Submission #3434864
Source Code Expand
#include<iostream> #include<cmath> using namespace std; int main() { int n,m; int X,Y; int xc[100],yc[100]; cin >> n >> m >> X >> Y; for(int i=0;i<n;i++) { cin >> xc[i]; } for(int i=0;i<m;i++) { cin >> yc[i]; } int zl = -101,zr = 101; for(int i=0;i<n;i++) { zl = max(zl,xc[i]); } for(int i=0;i<m;i++) { zr = min(zr,yc[i]); } //cout << zl << " " << zr << endl; if(zr <= zl) { cout << "War" << endl; return 0; } if(zr <= X || zl > Y) { cout << "War" << endl; return 0; } cout << "No War" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 1 Dimensional World's Tale |
User | marumine51 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 611 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | Sample | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 200 | 0 / 0 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
All | hand1, hand2, max1, max2, max3, max4, max5, max7, max8, normal1, normal2, normal3, normal4, normal5, sample_01, sample_02, sample_03 |
Sample | sample_01, sample_02, sample_03 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
hand1 | AC | 1 ms | 256 KB |
hand2 | AC | 1 ms | 256 KB |
max1 | AC | 1 ms | 256 KB |
max2 | AC | 1 ms | 256 KB |
max3 | WA | 1 ms | 256 KB |
max4 | AC | 1 ms | 256 KB |
max5 | AC | 1 ms | 256 KB |
max7 | AC | 1 ms | 256 KB |
max8 | AC | 1 ms | 256 KB |
normal1 | AC | 1 ms | 256 KB |
normal2 | AC | 1 ms | 256 KB |
normal3 | AC | 1 ms | 256 KB |
normal4 | AC | 1 ms | 256 KB |
normal5 | AC | 1 ms | 256 KB |
sample_01 | AC | 1 ms | 256 KB |
sample_02 | AC | 1 ms | 256 KB |
sample_03 | AC | 1 ms | 256 KB |