Submission #3253685
Source Code Expand
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, const char * argv[]) {
int N, M, X, Y;
cin >> N >> M >> X >> Y;
vector<int> x(N);
vector<int> y(M);
for(int i = 0; i < N; i++) cin >> x[i];
for(int i = 0; i < M; i++) cin >> y[i];
sort(x.begin(), x.end());
sort(y.begin(), y.end());
int z = y[0];
if (x[N] < z && X < z && z <= Y) {
cout << "No War" << endl;
} else {
cout << "War" << endl;
}
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | B - 1 Dimensional World's Tale |
| User | Shiro_K |
| Language | C++14 (Clang 3.8.0) |
| Score | 0 |
| Code Size | 569 Byte |
| Status | WA |
| Exec Time | 6 ms |
| Memory | 888 KiB |
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 | 6 ms | 888 KiB |
| hand2 | AC | 1 ms | 256 KiB |
| max1 | AC | 1 ms | 256 KiB |
| max2 | WA | 1 ms | 256 KiB |
| max3 | AC | 1 ms | 256 KiB |
| max4 | AC | 1 ms | 256 KiB |
| max5 | AC | 1 ms | 256 KiB |
| max7 | AC | 1 ms | 256 KiB |
| max8 | AC | 1 ms | 256 KiB |
| normal1 | AC | 1 ms | 256 KiB |
| normal2 | WA | 1 ms | 256 KiB |
| normal3 | AC | 1 ms | 256 KiB |
| normal4 | WA | 1 ms | 256 KiB |
| normal5 | WA | 1 ms | 256 KiB |
| sample_01 | AC | 1 ms | 256 KiB |
| sample_02 | AC | 1 ms | 256 KiB |
| sample_03 | AC | 1 ms | 256 KiB |