oj.uz

답안 #112995

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
112995 2019-05-23T02:13:07 Z model_code World of Tank (innopolis2018_final_E) C++17
100 / 100
 651 ms 152640 KB 
#include <bits/stdc++.h>  
   
using namespace std;
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define re return
#define fi first
#define mp make_pair
#define se second
#define sz(a) (int)a.size()
#define prev previ
#define tm tmmm
#define div divv
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
   
const ll CMAX = ll(1e9);
const int szk = 80000;
  
ll n, m1, m2, t, bad[2000100][2], dp[2000100][2], dp2[2000100][2];
vector<pair<int, int> > pq;
  
int main() {
    iostream::sync_with_stdio(0), cin.tie(0);
    pq.push_back(mp(1, -1));
    cin >> n >> m1 >> m2 >> t;
    pq.push_back(mp(n, -1));
    forn (i, m1) {
        int x;
        cin >> x;
        pq.push_back(mp(x, 0));
        if (x < n)
            pq.push_back(mp(x + 1, -1));
    }
    forn (i, m2) {
        int x;
        cin >> x;
        pq.push_back(mp(x, 1));
        if (x < n)
            pq.push_back(mp(x + 1, -1));
    }
    sort(pq.begin(), pq.end());
    int qxx = 0;
    vector<int> c;
    forn (i, sz(pq)) {
        if (i == 0 || pq[i].fi != pq[i - 1].fi) {
            c.push_back(pq[i].fi);
            qxx++;
        }
        if (pq[i].se != -1) {
            bad[sz(c) - 1][pq[i].se] = 1;
        }
    }
    forn (i, sz(c)) {
        dp[i][0] = dp[i][1] = -ll(1e18);
        //dp2[i][0] = dp2[i][1] = -ll(1e18);
    }
    if (bad[0][0] == 0) {
        dp[0][0] = dp2[0][0] = 1;
    }
    if (bad[0][1] == 0) {
        dp[0][1] = dp2[0][0] = 1;
    }
    //cout << dp[0][1] << " " << dp[0][0] << "\n";
    for (int i = 1; i < sz(c); i++) {
        forn (j, 2) {
            if (bad[i][j] == 0) {
                dp[i][j] = dp[i - 1][j] + c[i] - c[i - 1];
            }
            if (bad[i][j]) {
                if (dp[i - 1][j] + c[i] - c[i - 1] - t >= 1)
                    dp[i][j] = dp[i - 1][j] + c[i] - c[i - 1] - t;  
            }
        }
        ll k1 = min(dp[i][0],t), k2 = min(dp[i][1], t);
        if (bad[i][1] == 0)
            dp[i][1] = max(dp[i][1], k1);
        if (bad[i][0] == 0)
            dp[i][0] = max(dp[i][0], k2);
        //cout << dp[i][0] << " " << dp[i][1] << "\n";
    }
    if (dp[sz(c) - 1][0] < 0 && dp[sz(c) - 1][1] < 0) {
        cout << "No\n";
        exit(0);
    }
    cout << "Yes\n";
    vector<pair<int, int> > qx;
    vector<int> cp;
    vector<pair<int, int> > ps; 
    int x = sz(c) - 1, y = 0;
    if (dp[sz(c) - 1][1] >= 0)
        y = 1;
    while (x > 0) {
        qx.push_back(mp(c[x], y));
        cp.push_back(bad[x][y]);
        if (bad[x][y] == 0 && dp[x][y] == dp[x - 1][y] + c[x] - c[x - 1]) {
            x--;
            continue;
        }
        if (bad[x][y] == 1) {
            ps.push_back(mp(c[x], y));
            x--;
            continue;
        }
        y ^= 1;
        continue;
    }
    vector<int> bl;
    qx.push_back(mp(c[x], y));
    if (y == 1) {
        qx.push_back(mp(0, 1));
        qx.push_back(mp(0, 0));
        //bl.push_back(1);
        cp.push_back(0);
        cp.push_back(0);
    }
    bl.push_back(0);
    reverse(qx.begin(), qx.end());
    reverse(cp.begin(), cp.end());
    vector<int> nms; 
 
    forn (i, sz(qx)) {
        if (i && qx[i].se != qx[i - 1].se) {
            bl.push_back(bl.back() + 1);
            nms.push_back(qx[i].fi);
        } else
            if(i)bl.push_back(bl.back());
    }
    int qi = sz(cp);
    forn (i, sz(cp)) {
        if (cp[i]) {
            qi = i;
            break;
        }
    }
    vector<pair<int, int> > anss;
    int hv = 1;
 
    for (int i = 0; i < sz(qx); i++) {
        if (qx[i].fi == 0) continue;
        int psx = qx[i].fi, psy = qx[i].se;
        ll c = 0;
        //cout << hv << " " << qx[i].fi << " " << qx[i].se << " " << cp[i] << "\n";
        while (qi < sz(cp) && bl[qi] == bl[i]) {
            psx += max(t - hv, 0LL);
            c += max(t - hv, 0LL);
            hv = 0;
            anss.push_back(mp(psx, psy + 1));
            qi++;
            while (qi < sz(cp) && cp[qi] == 0) qi++;
        }
        if (i + 1 < sz(qx))
            hv+= qx[i + 1].fi - qx[i].fi-c;
         
        assert(hv >= 0 || (i + 1 < sz(qx) && qx[i + 1].se == psy));
    }
  
    cout << sz(nms) << "\n";
    for (int v : nms) cout << v << " ";
    cout << "\n";
    cout << sz(anss) << "\n";
    for (auto v : anss) cout << v.fi << " " << v.se << "\n";
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 20, m2 = 0, t = 20
2 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 509, m2 = 491, t = 5000
3 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 764, m2 = 736, t = 5000
4 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 698, m2 = 802, t = 5000
5 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 720, m2 = 780, t = 5000
6 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 734, m2 = 766, t = 5000
7 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 997, m2 = 1003, t = 5000
8 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 1021, m2 = 979, t = 5000
9 Correct 2 ms 512 KB [OK, No] n = 5000, m1 = 1006, m2 = 995, t = 5000
10 Correct 2 ms 512 KB [OK, No] n = 5000, m1 = 1017, m2 = 984, t = 5000
11 Correct 3 ms 640 KB [OK, No] n = 5000, m1 = 1495, m2 = 1506, t = 5000

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 20, m2 = 0, t = 20
2 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 509, m2 = 491, t = 5000
3 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 764, m2 = 736, t = 5000
4 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 698, m2 = 802, t = 5000
5 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 720, m2 = 780, t = 5000
6 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 734, m2 = 766, t = 5000
7 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 997, m2 = 1003, t = 5000
8 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 1021, m2 = 979, t = 5000
9 Correct 2 ms 512 KB [OK, No] n = 5000, m1 = 1006, m2 = 995, t = 5000
10 Correct 2 ms 512 KB [OK, No] n = 5000, m1 = 1017, m2 = 984, t = 5000
11 Correct 3 ms 640 KB [OK, No] n = 5000, m1 = 1495, m2 = 1506, t = 5000
12 Correct 2 ms 640 KB [OK, Yes] n = 5000, m1 = 974, m2 = 1026, t = 2501
13 Correct 4 ms 612 KB [OK, Yes] n = 5000, m1 = 1022, m2 = 978, t = 2501
14 Correct 2 ms 640 KB [OK, Yes] n = 5000, m1 = 1019, m2 = 981, t = 2501
15 Correct 3 ms 768 KB [OK, Yes] n = 5000, m1 = 1298, m2 = 1367, t = 2501
16 Correct 2 ms 512 KB [OK, No] n = 5000, m1 = 1301, m2 = 1360, t = 2501
17 Correct 3 ms 640 KB [OK, Yes] n = 5000, m1 = 1320, m2 = 1315, t = 2501
18 Correct 2 ms 512 KB [OK, No] n = 5000, m1 = 1195, m2 = 1135, t = 2501
19 Correct 3 ms 640 KB [OK, No] n = 5000, m1 = 1148, m2 = 1202, t = 2501
20 Correct 2 ms 512 KB [OK, No] n = 5000, m1 = 1147, m2 = 1179, t = 2501
21 Correct 2 ms 512 KB [OK, No] n = 5000, m1 = 1163, m2 = 1146, t = 2501
22 Correct 2 ms 640 KB [OK, No] n = 5000, m1 = 1145, m2 = 1184, t = 2501
23 Correct 2 ms 640 KB [OK, No] n = 5000, m1 = 1172, m2 = 1150, t = 2501

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 12, m2 = 9, t = 3
2 Correct 2 ms 384 KB [OK, Yes] n = 10, m1 = 4, m2 = 2, t = 2
3 Correct 2 ms 384 KB [OK, Yes] n = 10, m1 = 6, m2 = 0, t = 2
4 Correct 2 ms 384 KB [OK, Yes] n = 10, m1 = 2, m2 = 4, t = 1
5 Correct 2 ms 384 KB [OK, No] n = 20, m1 = 4, m2 = 11, t = 2
6 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 7, m2 = 8, t = 1
7 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 7, m2 = 8, t = 2
8 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 0, m2 = 10, t = 2
9 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 4, m2 = 6, t = 2
10 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 9, m2 = 1, t = 2
11 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 10, m2 = 9, t = 2
12 Correct 2 ms 304 KB [OK, Yes] n = 20, m1 = 9, m2 = 10, t = 2
13 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 0, m2 = 0, t = 3
14 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 5, m2 = 4, t = 3
15 Correct 2 ms 384 KB [OK, Yes] n = 9, m1 = 4, m2 = 3, t = 3
16 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 8, m2 = 8, t = 3
17 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 9, m2 = 7, t = 3
18 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 9, m2 = 10, t = 7
19 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 7, m2 = 10, t = 8
20 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 13, m2 = 10, t = 4
21 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 9, m2 = 9, t = 8
22 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 10, m2 = 11, t = 3
23 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 11, m2 = 11, t = 3

Subtask #4
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 20, m2 = 0, t = 20
2 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 509, m2 = 491, t = 5000
3 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 764, m2 = 736, t = 5000
4 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 698, m2 = 802, t = 5000
5 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 720, m2 = 780, t = 5000
6 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 734, m2 = 766, t = 5000
7 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 997, m2 = 1003, t = 5000
8 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 1021, m2 = 979, t = 5000
9 Correct 2 ms 512 KB [OK, No] n = 5000, m1 = 1006, m2 = 995, t = 5000
10 Correct 2 ms 512 KB [OK, No] n = 5000, m1 = 1017, m2 = 984, t = 5000
11 Correct 3 ms 640 KB [OK, No] n = 5000, m1 = 1495, m2 = 1506, t = 5000
12 Correct 2 ms 640 KB [OK, Yes] n = 5000, m1 = 974, m2 = 1026, t = 2501
13 Correct 4 ms 612 KB [OK, Yes] n = 5000, m1 = 1022, m2 = 978, t = 2501
14 Correct 2 ms 640 KB [OK, Yes] n = 5000, m1 = 1019, m2 = 981, t = 2501
15 Correct 3 ms 768 KB [OK, Yes] n = 5000, m1 = 1298, m2 = 1367, t = 2501
16 Correct 2 ms 512 KB [OK, No] n = 5000, m1 = 1301, m2 = 1360, t = 2501
17 Correct 3 ms 640 KB [OK, Yes] n = 5000, m1 = 1320, m2 = 1315, t = 2501
18 Correct 2 ms 512 KB [OK, No] n = 5000, m1 = 1195, m2 = 1135, t = 2501
19 Correct 3 ms 640 KB [OK, No] n = 5000, m1 = 1148, m2 = 1202, t = 2501
20 Correct 2 ms 512 KB [OK, No] n = 5000, m1 = 1147, m2 = 1179, t = 2501
21 Correct 2 ms 512 KB [OK, No] n = 5000, m1 = 1163, m2 = 1146, t = 2501
22 Correct 2 ms 640 KB [OK, No] n = 5000, m1 = 1145, m2 = 1184, t = 2501
23 Correct 2 ms 640 KB [OK, No] n = 5000, m1 = 1172, m2 = 1150, t = 2501
24 Correct 2 ms 384 KB [OK, Yes] n = 500, m1 = 197, m2 = 53, t = 2
25 Correct 2 ms 384 KB [OK, Yes] n = 500, m1 = 189, m2 = 61, t = 3
26 Correct 2 ms 384 KB [OK, No] n = 500, m1 = 66, m2 = 184, t = 4
27 Correct 2 ms 384 KB [OK, Yes] n = 500, m1 = 248, m2 = 252, t = 1
28 Correct 2 ms 384 KB [OK, Yes] n = 500, m1 = 248, m2 = 252, t = 1
29 Correct 1 ms 384 KB [OK, Yes] n = 500, m1 = 205, m2 = 295, t = 1
30 Correct 94 ms 29664 KB [OK, Yes] n = 1000000, m1 = 183472, m2 = 66528, t = 7
31 Correct 94 ms 29720 KB [OK, Yes] n = 1000000, m1 = 206211, m2 = 43789, t = 6
32 Correct 87 ms 29792 KB [OK, Yes] n = 1000000, m1 = 229445, m2 = 20555, t = 7
33 Correct 156 ms 36532 KB [OK, No] n = 1000000, m1 = 261335, m2 = 238665, t = 2
34 Correct 186 ms 52480 KB [OK, Yes] n = 1000000, m1 = 374819, m2 = 125181, t = 3
35 Correct 237 ms 52792 KB [OK, Yes] n = 1000000, m1 = 88376, m2 = 411624, t = 3
36 Correct 2 ms 384 KB [OK, Yes] n = 500, m1 = 125, m2 = 125, t = 2
37 Correct 244 ms 42924 KB [OK, Yes] n = 1000000, m1 = 250000, m2 = 250000, t = 2
38 Correct 94 ms 23768 KB [OK, Yes] n = 1000000, m1 = 94957, m2 = 94938, t = 12
39 Correct 98 ms 26156 KB [OK, Yes] n = 1000000, m1 = 94972, m2 = 95007, t = 10
40 Correct 15 ms 4472 KB [OK, Yes] n = 1000000, m1 = 14064, m2 = 13936, t = 200
41 Correct 16 ms 4976 KB [OK, Yes] n = 1000000, m1 = 15990, m2 = 16010, t = 139
42 Correct 31 ms 8944 KB [OK, Yes] n = 1000000, m1 = 32291, m2 = 32404, t = 34
43 Correct 84 ms 20832 KB [OK, Yes] n = 1000000, m1 = 88230, m2 = 88238, t = 13
44 Correct 43 ms 12656 KB [OK, Yes] n = 1000000, m1 = 44550, m2 = 44400, t = 34
45 Correct 31 ms 8824 KB [OK, Yes] n = 1000000, m1 = 31778, m2 = 31772, t = 44
46 Correct 110 ms 22100 KB [OK, No] n = 1000000, m1 = 147142, m2 = 147242, t = 10
47 Correct 2 ms 384 KB [OK, Yes] n = 1000, m1 = 416, m2 = 417, t = 77
48 Correct 3 ms 512 KB [OK, Yes] n = 1000, m1 = 412, m2 = 414, t = 111
49 Correct 2 ms 384 KB [OK, Yes] n = 1000, m1 = 422, m2 = 423, t = 62
50 Correct 2 ms 384 KB [OK, Yes] n = 800, m1 = 279, m2 = 270, t = 33

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 20, m2 = 0, t = 20
2 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 509, m2 = 491, t = 5000
3 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 764, m2 = 736, t = 5000
4 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 698, m2 = 802, t = 5000
5 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 720, m2 = 780, t = 5000
6 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 734, m2 = 766, t = 5000
7 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 997, m2 = 1003, t = 5000
8 Correct 2 ms 512 KB [OK, Yes] n = 5000, m1 = 1021, m2 = 979, t = 5000
9 Correct 2 ms 512 KB [OK, No] n = 5000, m1 = 1006, m2 = 995, t = 5000
10 Correct 2 ms 512 KB [OK, No] n = 5000, m1 = 1017, m2 = 984, t = 5000
11 Correct 3 ms 640 KB [OK, No] n = 5000, m1 = 1495, m2 = 1506, t = 5000
12 Correct 2 ms 640 KB [OK, Yes] n = 5000, m1 = 974, m2 = 1026, t = 2501
13 Correct 4 ms 612 KB [OK, Yes] n = 5000, m1 = 1022, m2 = 978, t = 2501
14 Correct 2 ms 640 KB [OK, Yes] n = 5000, m1 = 1019, m2 = 981, t = 2501
15 Correct 3 ms 768 KB [OK, Yes] n = 5000, m1 = 1298, m2 = 1367, t = 2501
16 Correct 2 ms 512 KB [OK, No] n = 5000, m1 = 1301, m2 = 1360, t = 2501
17 Correct 3 ms 640 KB [OK, Yes] n = 5000, m1 = 1320, m2 = 1315, t = 2501
18 Correct 2 ms 512 KB [OK, No] n = 5000, m1 = 1195, m2 = 1135, t = 2501
19 Correct 3 ms 640 KB [OK, No] n = 5000, m1 = 1148, m2 = 1202, t = 2501
20 Correct 2 ms 512 KB [OK, No] n = 5000, m1 = 1147, m2 = 1179, t = 2501
21 Correct 2 ms 512 KB [OK, No] n = 5000, m1 = 1163, m2 = 1146, t = 2501
22 Correct 2 ms 640 KB [OK, No] n = 5000, m1 = 1145, m2 = 1184, t = 2501
23 Correct 2 ms 640 KB [OK, No] n = 5000, m1 = 1172, m2 = 1150, t = 2501
24 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 12, m2 = 9, t = 3
25 Correct 2 ms 384 KB [OK, Yes] n = 10, m1 = 4, m2 = 2, t = 2
26 Correct 2 ms 384 KB [OK, Yes] n = 10, m1 = 6, m2 = 0, t = 2
27 Correct 2 ms 384 KB [OK, Yes] n = 10, m1 = 2, m2 = 4, t = 1
28 Correct 2 ms 384 KB [OK, No] n = 20, m1 = 4, m2 = 11, t = 2
29 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 7, m2 = 8, t = 1
30 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 7, m2 = 8, t = 2
31 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 0, m2 = 10, t = 2
32 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 4, m2 = 6, t = 2
33 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 9, m2 = 1, t = 2
34 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 10, m2 = 9, t = 2
35 Correct 2 ms 304 KB [OK, Yes] n = 20, m1 = 9, m2 = 10, t = 2
36 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 0, m2 = 0, t = 3
37 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 5, m2 = 4, t = 3
38 Correct 2 ms 384 KB [OK, Yes] n = 9, m1 = 4, m2 = 3, t = 3
39 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 8, m2 = 8, t = 3
40 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 9, m2 = 7, t = 3
41 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 9, m2 = 10, t = 7
42 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 7, m2 = 10, t = 8
43 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 13, m2 = 10, t = 4
44 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 9, m2 = 9, t = 8
45 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 10, m2 = 11, t = 3
46 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 11, m2 = 11, t = 3
47 Correct 2 ms 384 KB [OK, Yes] n = 500, m1 = 197, m2 = 53, t = 2
48 Correct 2 ms 384 KB [OK, Yes] n = 500, m1 = 189, m2 = 61, t = 3
49 Correct 2 ms 384 KB [OK, No] n = 500, m1 = 66, m2 = 184, t = 4
50 Correct 2 ms 384 KB [OK, Yes] n = 500, m1 = 248, m2 = 252, t = 1
51 Correct 2 ms 384 KB [OK, Yes] n = 500, m1 = 248, m2 = 252, t = 1
52 Correct 1 ms 384 KB [OK, Yes] n = 500, m1 = 205, m2 = 295, t = 1
53 Correct 94 ms 29664 KB [OK, Yes] n = 1000000, m1 = 183472, m2 = 66528, t = 7
54 Correct 94 ms 29720 KB [OK, Yes] n = 1000000, m1 = 206211, m2 = 43789, t = 6
55 Correct 87 ms 29792 KB [OK, Yes] n = 1000000, m1 = 229445, m2 = 20555, t = 7
56 Correct 156 ms 36532 KB [OK, No] n = 1000000, m1 = 261335, m2 = 238665, t = 2
57 Correct 186 ms 52480 KB [OK, Yes] n = 1000000, m1 = 374819, m2 = 125181, t = 3
58 Correct 237 ms 52792 KB [OK, Yes] n = 1000000, m1 = 88376, m2 = 411624, t = 3
59 Correct 2 ms 384 KB [OK, Yes] n = 500, m1 = 125, m2 = 125, t = 2
60 Correct 244 ms 42924 KB [OK, Yes] n = 1000000, m1 = 250000, m2 = 250000, t = 2
61 Correct 94 ms 23768 KB [OK, Yes] n = 1000000, m1 = 94957, m2 = 94938, t = 12
62 Correct 98 ms 26156 KB [OK, Yes] n = 1000000, m1 = 94972, m2 = 95007, t = 10
63 Correct 15 ms 4472 KB [OK, Yes] n = 1000000, m1 = 14064, m2 = 13936, t = 200
64 Correct 16 ms 4976 KB [OK, Yes] n = 1000000, m1 = 15990, m2 = 16010, t = 139
65 Correct 31 ms 8944 KB [OK, Yes] n = 1000000, m1 = 32291, m2 = 32404, t = 34
66 Correct 84 ms 20832 KB [OK, Yes] n = 1000000, m1 = 88230, m2 = 88238, t = 13
67 Correct 43 ms 12656 KB [OK, Yes] n = 1000000, m1 = 44550, m2 = 44400, t = 34
68 Correct 31 ms 8824 KB [OK, Yes] n = 1000000, m1 = 31778, m2 = 31772, t = 44
69 Correct 110 ms 22100 KB [OK, No] n = 1000000, m1 = 147142, m2 = 147242, t = 10
70 Correct 2 ms 384 KB [OK, Yes] n = 1000, m1 = 416, m2 = 417, t = 77
71 Correct 3 ms 512 KB [OK, Yes] n = 1000, m1 = 412, m2 = 414, t = 111
72 Correct 2 ms 384 KB [OK, Yes] n = 1000, m1 = 422, m2 = 423, t = 62
73 Correct 2 ms 384 KB [OK, Yes] n = 800, m1 = 279, m2 = 270, t = 33
74 Correct 2 ms 512 KB [OK, Yes] n = 1000000000, m1 = 489, m2 = 511, t = 3000000
75 Correct 3 ms 588 KB [OK, Yes] n = 100000000, m1 = 496, m2 = 504, t = 300000
76 Correct 2 ms 512 KB [OK, Yes] n = 100000000, m1 = 506, m2 = 494, t = 400000
77 Correct 3 ms 512 KB [OK, Yes] n = 100000000, m1 = 520, m2 = 480, t = 230000
78 Correct 3 ms 640 KB [OK, Yes] n = 1000000000, m1 = 995, m2 = 1005, t = 1100000
79 Correct 3 ms 640 KB [OK, Yes] n = 1000000000, m1 = 1016, m2 = 984, t = 1100003
80 Correct 485 ms 137788 KB [OK, Yes] n = 10000000, m1 = 423780, m2 = 576220, t = 1
81 Correct 490 ms 125888 KB [OK, Yes] n = 10000000, m1 = 102640, m2 = 897360, t = 16
82 Correct 360 ms 125948 KB [OK, Yes] n = 10000000, m1 = 922340, m2 = 77660, t = 6
83 Correct 627 ms 148928 KB [OK, Yes] n = 10000000, m1 = 66539, m2 = 933461, t = 5
84 Correct 508 ms 126144 KB [OK, Yes] n = 10000000, m1 = 156107, m2 = 843893, t = 17
85 Correct 366 ms 131008 KB [OK, Yes] n = 1000000000, m1 = 950948, m2 = 49052, t = 297
86 Correct 624 ms 149836 KB [OK, Yes] n = 1000000000, m1 = 288017, m2 = 711983, t = 1174
87 Correct 534 ms 131520 KB [OK, Yes] n = 1000000000, m1 = 103443, m2 = 896557, t = 1547
88 Correct 504 ms 131008 KB [OK, Yes] n = 1000000000, m1 = 51412, m2 = 948588, t = 1440
89 Correct 651 ms 152640 KB [OK, Yes] n = 1000000000, m1 = 192898, m2 = 807102, t = 581
90 Correct 554 ms 81600 KB [OK, Yes] n = 1000000000, m1 = 500000, m2 = 500000, t = 2
91 Correct 534 ms 116660 KB [OK, Yes] n = 1000000000, m1 = 499558, m2 = 500434, t = 2500
92 Correct 519 ms 112448 KB [OK, Yes] n = 1000000000, m1 = 496969, m2 = 497436, t = 3000
93 Correct 521 ms 106220 KB [OK, Yes] n = 1000000000, m1 = 444326, m2 = 444763, t = 4000
94 Correct 451 ms 85952 KB [OK, No] n = 1000000000, m1 = 499655, m2 = 500345, t = 2000
95 Correct 473 ms 104380 KB [OK, Yes] n = 1000000000, m1 = 423266, m2 = 423367, t = 4500
96 Correct 411 ms 91120 KB [OK, No] n = 1000000000, m1 = 499763, m2 = 500237, t = 3500
97 Correct 466 ms 102848 KB [OK, Yes] n = 1000000000, m1 = 404552, m2 = 404965, t = 5000