oj.uz

Submission #1035324

# Submission time Handle Problem Language Result Execution time Memory
1035324 2024-07-26T09:24:14 Z vjudge1 World of Tank (innopolis2018_final_E) C++17
15 / 100
 2 ms 604 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long




signed main()
{
    int n, m1, m2, t; cin >> n >> m1 >> m2 >> t;
    vector<vector<int>> a(3, vector<int> (n + 1));
    for (int i = 0; i < m1; i++){
        int x; cin >> x;
        a[1][x] = 1;
    }
    for (int i = 0; i < m2; i++){
        int x; cin >> x;
        a[2][x] = 1;
    }
    
    
    set<int> ans;
    bool f = 0;
    int pos = 1;
    for (int i = 0; i < n; i++){
        if (a[pos][i + 1]){
            ans.insert(i);
            pos = 3 - pos;
            if (a[pos][i] || a[pos][i + 1]){
                f = 1;
                break;
            }
        }
    }
    if (f) cout << "No" << endl;
    else{
        cout << "Yes" << endl;
        cout << ans.size() << endl;
        for (int x : ans){
            cout << x << ' ';
        }
        cout << endl;
        cout << 0 << endl;
    }
    
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB [OK, Yes] n = 20, m1 = 20, m2 = 0, t = 20
2 Correct 0 ms 348 KB [OK, Yes] n = 5000, m1 = 509, m2 = 491, t = 5000
3 Correct 1 ms 348 KB [OK, Yes] n = 5000, m1 = 764, m2 = 736, t = 5000
4 Correct 1 ms 348 KB [OK, Yes] n = 5000, m1 = 698, m2 = 802, t = 5000
5 Correct 1 ms 344 KB [OK, Yes] n = 5000, m1 = 720, m2 = 780, t = 5000
6 Correct 0 ms 440 KB [OK, Yes] n = 5000, m1 = 734, m2 = 766, t = 5000
7 Correct 1 ms 604 KB [OK, Yes] n = 5000, m1 = 997, m2 = 1003, t = 5000
8 Correct 1 ms 600 KB [OK, Yes] n = 5000, m1 = 1021, m2 = 979, t = 5000
9 Correct 1 ms 600 KB [OK, No] n = 5000, m1 = 1006, m2 = 995, t = 5000
10 Correct 1 ms 600 KB [OK, No] n = 5000, m1 = 1017, m2 = 984, t = 5000
11 Correct 1 ms 348 KB [OK, No] n = 5000, m1 = 1495, m2 = 1506, t = 5000

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB [OK, Yes] n = 20, m1 = 20, m2 = 0, t = 20
2 Correct 0 ms 348 KB [OK, Yes] n = 5000, m1 = 509, m2 = 491, t = 5000
3 Correct 1 ms 348 KB [OK, Yes] n = 5000, m1 = 764, m2 = 736, t = 5000
4 Correct 1 ms 348 KB [OK, Yes] n = 5000, m1 = 698, m2 = 802, t = 5000
5 Correct 1 ms 344 KB [OK, Yes] n = 5000, m1 = 720, m2 = 780, t = 5000
6 Correct 0 ms 440 KB [OK, Yes] n = 5000, m1 = 734, m2 = 766, t = 5000
7 Correct 1 ms 604 KB [OK, Yes] n = 5000, m1 = 997, m2 = 1003, t = 5000
8 Correct 1 ms 600 KB [OK, Yes] n = 5000, m1 = 1021, m2 = 979, t = 5000
9 Correct 1 ms 600 KB [OK, No] n = 5000, m1 = 1006, m2 = 995, t = 5000
10 Correct 1 ms 600 KB [OK, No] n = 5000, m1 = 1017, m2 = 984, t = 5000
11 Correct 1 ms 348 KB [OK, No] n = 5000, m1 = 1495, m2 = 1506, t = 5000
12 Correct 1 ms 600 KB [OK, Yes] n = 5000, m1 = 974, m2 = 1026, t = 2501
13 Correct 1 ms 348 KB [OK, Yes] n = 5000, m1 = 1022, m2 = 978, t = 2501
14 Correct 1 ms 596 KB [OK, Yes] n = 5000, m1 = 1019, m2 = 981, t = 2501
15 Incorrect 2 ms 604 KB [No solution found] n = 5000, m1 = 1298, m2 = 1367, t = 2501
16 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB [No solution found] n = 20, m1 = 12, m2 = 9, t = 3
2 Halted 0 ms 0 KB -

Subtask #4
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB [OK, Yes] n = 20, m1 = 20, m2 = 0, t = 20
2 Correct 0 ms 348 KB [OK, Yes] n = 5000, m1 = 509, m2 = 491, t = 5000
3 Correct 1 ms 348 KB [OK, Yes] n = 5000, m1 = 764, m2 = 736, t = 5000
4 Correct 1 ms 348 KB [OK, Yes] n = 5000, m1 = 698, m2 = 802, t = 5000
5 Correct 1 ms 344 KB [OK, Yes] n = 5000, m1 = 720, m2 = 780, t = 5000
6 Correct 0 ms 440 KB [OK, Yes] n = 5000, m1 = 734, m2 = 766, t = 5000
7 Correct 1 ms 604 KB [OK, Yes] n = 5000, m1 = 997, m2 = 1003, t = 5000
8 Correct 1 ms 600 KB [OK, Yes] n = 5000, m1 = 1021, m2 = 979, t = 5000
9 Correct 1 ms 600 KB [OK, No] n = 5000, m1 = 1006, m2 = 995, t = 5000
10 Correct 1 ms 600 KB [OK, No] n = 5000, m1 = 1017, m2 = 984, t = 5000
11 Correct 1 ms 348 KB [OK, No] n = 5000, m1 = 1495, m2 = 1506, t = 5000
12 Correct 1 ms 600 KB [OK, Yes] n = 5000, m1 = 974, m2 = 1026, t = 2501
13 Correct 1 ms 348 KB [OK, Yes] n = 5000, m1 = 1022, m2 = 978, t = 2501
14 Correct 1 ms 596 KB [OK, Yes] n = 5000, m1 = 1019, m2 = 981, t = 2501
15 Incorrect 2 ms 604 KB [No solution found] n = 5000, m1 = 1298, m2 = 1367, t = 2501
16 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB [OK, Yes] n = 20, m1 = 20, m2 = 0, t = 20
2 Correct 0 ms 348 KB [OK, Yes] n = 5000, m1 = 509, m2 = 491, t = 5000
3 Correct 1 ms 348 KB [OK, Yes] n = 5000, m1 = 764, m2 = 736, t = 5000
4 Correct 1 ms 348 KB [OK, Yes] n = 5000, m1 = 698, m2 = 802, t = 5000
5 Correct 1 ms 344 KB [OK, Yes] n = 5000, m1 = 720, m2 = 780, t = 5000
6 Correct 0 ms 440 KB [OK, Yes] n = 5000, m1 = 734, m2 = 766, t = 5000
7 Correct 1 ms 604 KB [OK, Yes] n = 5000, m1 = 997, m2 = 1003, t = 5000
8 Correct 1 ms 600 KB [OK, Yes] n = 5000, m1 = 1021, m2 = 979, t = 5000
9 Correct 1 ms 600 KB [OK, No] n = 5000, m1 = 1006, m2 = 995, t = 5000
10 Correct 1 ms 600 KB [OK, No] n = 5000, m1 = 1017, m2 = 984, t = 5000
11 Correct 1 ms 348 KB [OK, No] n = 5000, m1 = 1495, m2 = 1506, t = 5000
12 Correct 1 ms 600 KB [OK, Yes] n = 5000, m1 = 974, m2 = 1026, t = 2501
13 Correct 1 ms 348 KB [OK, Yes] n = 5000, m1 = 1022, m2 = 978, t = 2501
14 Correct 1 ms 596 KB [OK, Yes] n = 5000, m1 = 1019, m2 = 981, t = 2501
15 Incorrect 2 ms 604 KB [No solution found] n = 5000, m1 = 1298, m2 = 1367, t = 2501
16 Halted 0 ms 0 KB -