Submission #3432611


Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int N, M, X, Y;
    cin >> N >> M >> X >> Y;
    vector<int> x, y;
    for (size_t i = 0; i < N; i++) {
        int p;
        cin >> p;
        x.push_back(p);
    }
    x.push_back(X);
    for (size_t i = 0; i < M; i++) {
        int p;
        cin >> p;
        y.push_back(p);
    }
    y.push_back(Y);

    int x_max = *max_element(x.begin(), x.end());
    int y_min = *min_element(y.begin(), y.end());

    if( x_max < y_min ) {
        cout << "No War" << endl;
    } else {
        cout << "War" << endl;
    }
}

Submission Info

Submission Time
Task B - 1 Dimensional World's Tale
User marun
Language C++14 (Clang 3.8.0)
Score 200
Code Size 652 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All Sample
Score / Max Score 200 / 200 0 / 0
Status
AC × 17
AC × 3
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 AC 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