답안 #879595

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
879595 2023-11-27T16:53:20 Z Rafi22 World of Tank (innopolis2018_final_E) C++14
100 / 100
1097 ms 262144 KB
#include <bits/stdc++.h>
#pragma GCC target ("avx2,fma")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")

//#define int long long
#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
ll infl=1000000000000000007;
int inf=1000000007;
int mod=1000000007;
int mod1=998244353;

const int N=1000007;

int a[N][2];
map<int,int>M;

int DP[3*N][2];
int zkad[3*N][2];
bool blocked[3*N][2];

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    vector<int>S;
    int n,m1,m2,t;
    cin>>n>>m1>>m2>>t;
    S.pb(0);
    S.pb(n+1);
    for(int i=1;i<=m1;i++)
    {
        cin>>a[i][0];
        S.pb(a[i][0]);
        S.pb(a[i][0]-1);
        S.pb(a[i][0]+1);
    }
    for(int i=1;i<=m2;i++)
    {
        cin>>a[i][1];
        S.pb(a[i][1]);
        S.pb(a[i][1]-1);
        S.pb(a[i][1]+1);
    }
    sort(all(S));
    int k=1;
    vector<int>d={213769420,0};
    M[0]=1;
    for(int i=1;i<sz(S);i++)
    {
        if(S[i]!=S[i-1])
        {
            k++;
            d.pb(S[i]);
        }
        M[S[i]]=k;
    }
    for(int i=1;i<=m1;i++) blocked[M[a[i][0]]][0]=1;
    for(int i=1;i<=m2;i++) blocked[M[a[i][1]]][1]=1;
    for(int j=0;j<2;j++) for(int i=1;i<=k;i++) DP[i][j]=-inf;
    DP[1][0]=0;
    for(int i=1;i<=k;i++)
    {
        for(int j=0;j<2;j++)
        {
            if(DP[i][j]<0) continue;
            if(!blocked[i][j^1]&&min(t,DP[i][j])>DP[i][j^1])
            {
                DP[i][j^1]=min(t,DP[i][j]);
                zkad[i][j^1]=2;
            }
        }
       // cout<<DP[i][0]<<" "<<DP[i][1]<<" "<<d[i]<<endl;
        for(int j=0;j<2;j++)
        {
            if(DP[i][j]<0) continue;
            if(blocked[i+1][j])
            {
                if(DP[i][j]>=t&&DP[i][j]+1-t>DP[i+1][j])
                {
                    DP[i+1][j]=DP[i][j]+1-t;
                    zkad[i+1][j]=3;
                }
            }
            else if(DP[i][j]+d[i+1]-d[i]>DP[i+1][j])
            {
                DP[i+1][j]=DP[i][j]+d[i+1]-d[i];
                zkad[i+1][j]=1;
            }
        }
    }
    if(DP[k][0]>0)
    {
        cout<<"Yes"<<endl;
        int i=k,j=0;
        vector<int>X;
        vector<pair<int,int>>Y;
        while(zkad[i][j]!=0)
        {
            if(zkad[i][j]==1) i--;
            else if(zkad[i][j]==2)
            {
                X.pb(d[i]);
                j^=1;
            }
            else
            {
                Y.pb({d[i]-DP[i][j],j+1});
                i--;
            }
        }
        reverse(all(X));
        reverse(all(Y));
        cout<<sz(X)<<endl;
        for(auto x:X) cout<<x<<" ";
        cout<<endl;
        cout<<sz(Y)<<endl;
        for(auto [x,y]:Y) cout<<x<<" "<<y<<endl;
    }
    else cout<<"No"<<endl;
}

Compilation message

E.cpp: In function 'int main()':
E.cpp:127:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  127 |         for(auto [x,y]:Y) cout<<x<<" "<<y<<endl;
      |                  ^
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB [OK, Yes] n = 20, m1 = 20, m2 = 0, t = 20
2 Correct 1 ms 6492 KB [OK, Yes] n = 5000, m1 = 509, m2 = 491, t = 5000
3 Correct 1 ms 6748 KB [OK, Yes] n = 5000, m1 = 764, m2 = 736, t = 5000
4 Correct 1 ms 6748 KB [OK, Yes] n = 5000, m1 = 698, m2 = 802, t = 5000
5 Correct 1 ms 6748 KB [OK, Yes] n = 5000, m1 = 720, m2 = 780, t = 5000
6 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 734, m2 = 766, t = 5000
7 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 997, m2 = 1003, t = 5000
8 Correct 2 ms 6744 KB [OK, Yes] n = 5000, m1 = 1021, m2 = 979, t = 5000
9 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1006, m2 = 995, t = 5000
10 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1017, m2 = 984, t = 5000
11 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1495, m2 = 1506, t = 5000
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB [OK, Yes] n = 20, m1 = 20, m2 = 0, t = 20
2 Correct 1 ms 6492 KB [OK, Yes] n = 5000, m1 = 509, m2 = 491, t = 5000
3 Correct 1 ms 6748 KB [OK, Yes] n = 5000, m1 = 764, m2 = 736, t = 5000
4 Correct 1 ms 6748 KB [OK, Yes] n = 5000, m1 = 698, m2 = 802, t = 5000
5 Correct 1 ms 6748 KB [OK, Yes] n = 5000, m1 = 720, m2 = 780, t = 5000
6 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 734, m2 = 766, t = 5000
7 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 997, m2 = 1003, t = 5000
8 Correct 2 ms 6744 KB [OK, Yes] n = 5000, m1 = 1021, m2 = 979, t = 5000
9 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1006, m2 = 995, t = 5000
10 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1017, m2 = 984, t = 5000
11 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1495, m2 = 1506, t = 5000
12 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 974, m2 = 1026, t = 2501
13 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 1022, m2 = 978, t = 2501
14 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 1019, m2 = 981, t = 2501
15 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 1298, m2 = 1367, t = 2501
16 Correct 2 ms 6744 KB [OK, No] n = 5000, m1 = 1301, m2 = 1360, t = 2501
17 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 1320, m2 = 1315, t = 2501
18 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1195, m2 = 1135, t = 2501
19 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1148, m2 = 1202, t = 2501
20 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1147, m2 = 1179, t = 2501
21 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1163, m2 = 1146, t = 2501
22 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1145, m2 = 1184, t = 2501
23 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1172, m2 = 1150, t = 2501
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB [OK, Yes] n = 20, m1 = 12, m2 = 9, t = 3
2 Correct 1 ms 6492 KB [OK, Yes] n = 10, m1 = 4, m2 = 2, t = 2
3 Correct 1 ms 6492 KB [OK, Yes] n = 10, m1 = 6, m2 = 0, t = 2
4 Correct 1 ms 6492 KB [OK, Yes] n = 10, m1 = 2, m2 = 4, t = 1
5 Correct 1 ms 6492 KB [OK, No] n = 20, m1 = 4, m2 = 11, t = 2
6 Correct 1 ms 6492 KB [OK, Yes] n = 20, m1 = 7, m2 = 8, t = 1
7 Correct 1 ms 6492 KB [OK, Yes] n = 20, m1 = 7, m2 = 8, t = 2
8 Correct 1 ms 6492 KB [OK, Yes] n = 20, m1 = 0, m2 = 10, t = 2
9 Correct 1 ms 6492 KB [OK, Yes] n = 20, m1 = 4, m2 = 6, t = 2
10 Correct 1 ms 6612 KB [OK, Yes] n = 20, m1 = 9, m2 = 1, t = 2
11 Correct 1 ms 6488 KB [OK, Yes] n = 20, m1 = 10, m2 = 9, t = 2
12 Correct 1 ms 6492 KB [OK, Yes] n = 20, m1 = 9, m2 = 10, t = 2
13 Correct 1 ms 6492 KB [OK, Yes] n = 20, m1 = 0, m2 = 0, t = 3
14 Correct 1 ms 6488 KB [OK, Yes] n = 20, m1 = 5, m2 = 4, t = 3
15 Correct 1 ms 6492 KB [OK, Yes] n = 9, m1 = 4, m2 = 3, t = 3
16 Correct 1 ms 6488 KB [OK, Yes] n = 20, m1 = 8, m2 = 8, t = 3
17 Correct 1 ms 6500 KB [OK, Yes] n = 20, m1 = 9, m2 = 7, t = 3
18 Correct 1 ms 6488 KB [OK, Yes] n = 20, m1 = 9, m2 = 10, t = 7
19 Correct 1 ms 6488 KB [OK, Yes] n = 20, m1 = 7, m2 = 10, t = 8
20 Correct 1 ms 6492 KB [OK, Yes] n = 20, m1 = 13, m2 = 10, t = 4
21 Correct 1 ms 6612 KB [OK, Yes] n = 20, m1 = 9, m2 = 9, t = 8
22 Correct 1 ms 6492 KB [OK, Yes] n = 20, m1 = 10, m2 = 11, t = 3
23 Correct 1 ms 6628 KB [OK, Yes] n = 20, m1 = 11, m2 = 11, t = 3
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB [OK, Yes] n = 20, m1 = 20, m2 = 0, t = 20
2 Correct 1 ms 6492 KB [OK, Yes] n = 5000, m1 = 509, m2 = 491, t = 5000
3 Correct 1 ms 6748 KB [OK, Yes] n = 5000, m1 = 764, m2 = 736, t = 5000
4 Correct 1 ms 6748 KB [OK, Yes] n = 5000, m1 = 698, m2 = 802, t = 5000
5 Correct 1 ms 6748 KB [OK, Yes] n = 5000, m1 = 720, m2 = 780, t = 5000
6 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 734, m2 = 766, t = 5000
7 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 997, m2 = 1003, t = 5000
8 Correct 2 ms 6744 KB [OK, Yes] n = 5000, m1 = 1021, m2 = 979, t = 5000
9 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1006, m2 = 995, t = 5000
10 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1017, m2 = 984, t = 5000
11 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1495, m2 = 1506, t = 5000
12 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 974, m2 = 1026, t = 2501
13 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 1022, m2 = 978, t = 2501
14 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 1019, m2 = 981, t = 2501
15 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 1298, m2 = 1367, t = 2501
16 Correct 2 ms 6744 KB [OK, No] n = 5000, m1 = 1301, m2 = 1360, t = 2501
17 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 1320, m2 = 1315, t = 2501
18 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1195, m2 = 1135, t = 2501
19 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1148, m2 = 1202, t = 2501
20 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1147, m2 = 1179, t = 2501
21 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1163, m2 = 1146, t = 2501
22 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1145, m2 = 1184, t = 2501
23 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1172, m2 = 1150, t = 2501
24 Correct 1 ms 6492 KB [OK, Yes] n = 500, m1 = 197, m2 = 53, t = 2
25 Correct 1 ms 6492 KB [OK, Yes] n = 500, m1 = 189, m2 = 61, t = 3
26 Correct 1 ms 6492 KB [OK, No] n = 500, m1 = 66, m2 = 184, t = 4
27 Correct 1 ms 6492 KB [OK, Yes] n = 500, m1 = 248, m2 = 252, t = 1
28 Correct 1 ms 6492 KB [OK, Yes] n = 500, m1 = 248, m2 = 252, t = 1
29 Correct 1 ms 6492 KB [OK, Yes] n = 500, m1 = 205, m2 = 295, t = 1
30 Correct 195 ms 54204 KB [OK, Yes] n = 1000000, m1 = 183472, m2 = 66528, t = 7
31 Correct 195 ms 53436 KB [OK, Yes] n = 1000000, m1 = 206211, m2 = 43789, t = 6
32 Correct 186 ms 54688 KB [OK, Yes] n = 1000000, m1 = 229445, m2 = 20555, t = 7
33 Correct 347 ms 67592 KB [OK, No] n = 1000000, m1 = 261335, m2 = 238665, t = 2
34 Correct 378 ms 82068 KB [OK, Yes] n = 1000000, m1 = 374819, m2 = 125181, t = 3
35 Correct 429 ms 83128 KB [OK, Yes] n = 1000000, m1 = 88376, m2 = 411624, t = 3
36 Correct 1 ms 6492 KB [OK, Yes] n = 500, m1 = 125, m2 = 125, t = 2
37 Correct 408 ms 61204 KB [OK, Yes] n = 1000000, m1 = 250000, m2 = 250000, t = 2
38 Correct 164 ms 43712 KB [OK, Yes] n = 1000000, m1 = 94957, m2 = 94938, t = 12
39 Correct 172 ms 46268 KB [OK, Yes] n = 1000000, m1 = 94972, m2 = 95007, t = 10
40 Correct 21 ms 13528 KB [OK, Yes] n = 1000000, m1 = 14064, m2 = 13936, t = 200
41 Correct 31 ms 16336 KB [OK, Yes] n = 1000000, m1 = 15990, m2 = 16010, t = 139
42 Correct 56 ms 21704 KB [OK, Yes] n = 1000000, m1 = 32291, m2 = 32404, t = 34
43 Correct 148 ms 38948 KB [OK, Yes] n = 1000000, m1 = 88230, m2 = 88238, t = 13
44 Correct 73 ms 27340 KB [OK, Yes] n = 1000000, m1 = 44550, m2 = 44400, t = 34
45 Correct 62 ms 21600 KB [OK, Yes] n = 1000000, m1 = 31778, m2 = 31772, t = 44
46 Correct 242 ms 51684 KB [OK, No] n = 1000000, m1 = 147142, m2 = 147242, t = 10
47 Correct 1 ms 6492 KB [OK, Yes] n = 1000, m1 = 416, m2 = 417, t = 77
48 Correct 1 ms 6608 KB [OK, Yes] n = 1000, m1 = 412, m2 = 414, t = 111
49 Correct 1 ms 6492 KB [OK, Yes] n = 1000, m1 = 422, m2 = 423, t = 62
50 Correct 1 ms 6492 KB [OK, Yes] n = 800, m1 = 279, m2 = 270, t = 33
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB [OK, Yes] n = 20, m1 = 20, m2 = 0, t = 20
2 Correct 1 ms 6492 KB [OK, Yes] n = 5000, m1 = 509, m2 = 491, t = 5000
3 Correct 1 ms 6748 KB [OK, Yes] n = 5000, m1 = 764, m2 = 736, t = 5000
4 Correct 1 ms 6748 KB [OK, Yes] n = 5000, m1 = 698, m2 = 802, t = 5000
5 Correct 1 ms 6748 KB [OK, Yes] n = 5000, m1 = 720, m2 = 780, t = 5000
6 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 734, m2 = 766, t = 5000
7 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 997, m2 = 1003, t = 5000
8 Correct 2 ms 6744 KB [OK, Yes] n = 5000, m1 = 1021, m2 = 979, t = 5000
9 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1006, m2 = 995, t = 5000
10 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1017, m2 = 984, t = 5000
11 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1495, m2 = 1506, t = 5000
12 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 974, m2 = 1026, t = 2501
13 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 1022, m2 = 978, t = 2501
14 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 1019, m2 = 981, t = 2501
15 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 1298, m2 = 1367, t = 2501
16 Correct 2 ms 6744 KB [OK, No] n = 5000, m1 = 1301, m2 = 1360, t = 2501
17 Correct 2 ms 6748 KB [OK, Yes] n = 5000, m1 = 1320, m2 = 1315, t = 2501
18 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1195, m2 = 1135, t = 2501
19 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1148, m2 = 1202, t = 2501
20 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1147, m2 = 1179, t = 2501
21 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1163, m2 = 1146, t = 2501
22 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1145, m2 = 1184, t = 2501
23 Correct 2 ms 6748 KB [OK, No] n = 5000, m1 = 1172, m2 = 1150, t = 2501
24 Correct 1 ms 6488 KB [OK, Yes] n = 20, m1 = 12, m2 = 9, t = 3
25 Correct 1 ms 6492 KB [OK, Yes] n = 10, m1 = 4, m2 = 2, t = 2
26 Correct 1 ms 6492 KB [OK, Yes] n = 10, m1 = 6, m2 = 0, t = 2
27 Correct 1 ms 6492 KB [OK, Yes] n = 10, m1 = 2, m2 = 4, t = 1
28 Correct 1 ms 6492 KB [OK, No] n = 20, m1 = 4, m2 = 11, t = 2
29 Correct 1 ms 6492 KB [OK, Yes] n = 20, m1 = 7, m2 = 8, t = 1
30 Correct 1 ms 6492 KB [OK, Yes] n = 20, m1 = 7, m2 = 8, t = 2
31 Correct 1 ms 6492 KB [OK, Yes] n = 20, m1 = 0, m2 = 10, t = 2
32 Correct 1 ms 6492 KB [OK, Yes] n = 20, m1 = 4, m2 = 6, t = 2
33 Correct 1 ms 6612 KB [OK, Yes] n = 20, m1 = 9, m2 = 1, t = 2
34 Correct 1 ms 6488 KB [OK, Yes] n = 20, m1 = 10, m2 = 9, t = 2
35 Correct 1 ms 6492 KB [OK, Yes] n = 20, m1 = 9, m2 = 10, t = 2
36 Correct 1 ms 6492 KB [OK, Yes] n = 20, m1 = 0, m2 = 0, t = 3
37 Correct 1 ms 6488 KB [OK, Yes] n = 20, m1 = 5, m2 = 4, t = 3
38 Correct 1 ms 6492 KB [OK, Yes] n = 9, m1 = 4, m2 = 3, t = 3
39 Correct 1 ms 6488 KB [OK, Yes] n = 20, m1 = 8, m2 = 8, t = 3
40 Correct 1 ms 6500 KB [OK, Yes] n = 20, m1 = 9, m2 = 7, t = 3
41 Correct 1 ms 6488 KB [OK, Yes] n = 20, m1 = 9, m2 = 10, t = 7
42 Correct 1 ms 6488 KB [OK, Yes] n = 20, m1 = 7, m2 = 10, t = 8
43 Correct 1 ms 6492 KB [OK, Yes] n = 20, m1 = 13, m2 = 10, t = 4
44 Correct 1 ms 6612 KB [OK, Yes] n = 20, m1 = 9, m2 = 9, t = 8
45 Correct 1 ms 6492 KB [OK, Yes] n = 20, m1 = 10, m2 = 11, t = 3
46 Correct 1 ms 6628 KB [OK, Yes] n = 20, m1 = 11, m2 = 11, t = 3
47 Correct 1 ms 6492 KB [OK, Yes] n = 500, m1 = 197, m2 = 53, t = 2
48 Correct 1 ms 6492 KB [OK, Yes] n = 500, m1 = 189, m2 = 61, t = 3
49 Correct 1 ms 6492 KB [OK, No] n = 500, m1 = 66, m2 = 184, t = 4
50 Correct 1 ms 6492 KB [OK, Yes] n = 500, m1 = 248, m2 = 252, t = 1
51 Correct 1 ms 6492 KB [OK, Yes] n = 500, m1 = 248, m2 = 252, t = 1
52 Correct 1 ms 6492 KB [OK, Yes] n = 500, m1 = 205, m2 = 295, t = 1
53 Correct 195 ms 54204 KB [OK, Yes] n = 1000000, m1 = 183472, m2 = 66528, t = 7
54 Correct 195 ms 53436 KB [OK, Yes] n = 1000000, m1 = 206211, m2 = 43789, t = 6
55 Correct 186 ms 54688 KB [OK, Yes] n = 1000000, m1 = 229445, m2 = 20555, t = 7
56 Correct 347 ms 67592 KB [OK, No] n = 1000000, m1 = 261335, m2 = 238665, t = 2
57 Correct 378 ms 82068 KB [OK, Yes] n = 1000000, m1 = 374819, m2 = 125181, t = 3
58 Correct 429 ms 83128 KB [OK, Yes] n = 1000000, m1 = 88376, m2 = 411624, t = 3
59 Correct 1 ms 6492 KB [OK, Yes] n = 500, m1 = 125, m2 = 125, t = 2
60 Correct 408 ms 61204 KB [OK, Yes] n = 1000000, m1 = 250000, m2 = 250000, t = 2
61 Correct 164 ms 43712 KB [OK, Yes] n = 1000000, m1 = 94957, m2 = 94938, t = 12
62 Correct 172 ms 46268 KB [OK, Yes] n = 1000000, m1 = 94972, m2 = 95007, t = 10
63 Correct 21 ms 13528 KB [OK, Yes] n = 1000000, m1 = 14064, m2 = 13936, t = 200
64 Correct 31 ms 16336 KB [OK, Yes] n = 1000000, m1 = 15990, m2 = 16010, t = 139
65 Correct 56 ms 21704 KB [OK, Yes] n = 1000000, m1 = 32291, m2 = 32404, t = 34
66 Correct 148 ms 38948 KB [OK, Yes] n = 1000000, m1 = 88230, m2 = 88238, t = 13
67 Correct 73 ms 27340 KB [OK, Yes] n = 1000000, m1 = 44550, m2 = 44400, t = 34
68 Correct 62 ms 21600 KB [OK, Yes] n = 1000000, m1 = 31778, m2 = 31772, t = 44
69 Correct 242 ms 51684 KB [OK, No] n = 1000000, m1 = 147142, m2 = 147242, t = 10
70 Correct 1 ms 6492 KB [OK, Yes] n = 1000, m1 = 416, m2 = 417, t = 77
71 Correct 1 ms 6608 KB [OK, Yes] n = 1000, m1 = 412, m2 = 414, t = 111
72 Correct 1 ms 6492 KB [OK, Yes] n = 1000, m1 = 422, m2 = 423, t = 62
73 Correct 1 ms 6492 KB [OK, Yes] n = 800, m1 = 279, m2 = 270, t = 33
74 Correct 2 ms 6748 KB [OK, Yes] n = 1000000000, m1 = 489, m2 = 511, t = 3000000
75 Correct 2 ms 6784 KB [OK, Yes] n = 100000000, m1 = 496, m2 = 504, t = 300000
76 Correct 1 ms 6748 KB [OK, Yes] n = 100000000, m1 = 506, m2 = 494, t = 400000
77 Correct 2 ms 6748 KB [OK, Yes] n = 100000000, m1 = 520, m2 = 480, t = 230000
78 Correct 2 ms 7004 KB [OK, Yes] n = 1000000000, m1 = 995, m2 = 1005, t = 1100000
79 Correct 3 ms 7004 KB [OK, Yes] n = 1000000000, m1 = 1016, m2 = 984, t = 1100003
80 Correct 1065 ms 222596 KB [OK, Yes] n = 10000000, m1 = 423780, m2 = 576220, t = 1
81 Correct 1097 ms 222132 KB [OK, Yes] n = 10000000, m1 = 102640, m2 = 897360, t = 16
82 Correct 1060 ms 244372 KB [OK, Yes] n = 10000000, m1 = 922340, m2 = 77660, t = 6
83 Correct 992 ms 220904 KB [OK, Yes] n = 10000000, m1 = 66539, m2 = 933461, t = 5
84 Correct 1018 ms 220452 KB [OK, Yes] n = 10000000, m1 = 156107, m2 = 843893, t = 17
85 Correct 1004 ms 262144 KB [OK, Yes] n = 1000000000, m1 = 950948, m2 = 49052, t = 297
86 Correct 1082 ms 247148 KB [OK, Yes] n = 1000000000, m1 = 288017, m2 = 711983, t = 1174
87 Correct 1038 ms 239536 KB [OK, Yes] n = 1000000000, m1 = 103443, m2 = 896557, t = 1547
88 Correct 1016 ms 237424 KB [OK, Yes] n = 1000000000, m1 = 51412, m2 = 948588, t = 1440
89 Correct 1070 ms 240060 KB [OK, Yes] n = 1000000000, m1 = 192898, m2 = 807102, t = 581
90 Correct 851 ms 112612 KB [OK, Yes] n = 1000000000, m1 = 500000, m2 = 500000, t = 2
91 Correct 945 ms 182240 KB [OK, Yes] n = 1000000000, m1 = 499558, m2 = 500434, t = 2500
92 Correct 934 ms 175368 KB [OK, Yes] n = 1000000000, m1 = 496969, m2 = 497436, t = 3000
93 Correct 865 ms 159956 KB [OK, Yes] n = 1000000000, m1 = 444326, m2 = 444763, t = 4000
94 Correct 1024 ms 176964 KB [OK, No] n = 1000000000, m1 = 499655, m2 = 500345, t = 2000
95 Correct 832 ms 157048 KB [OK, Yes] n = 1000000000, m1 = 423266, m2 = 423367, t = 4500
96 Correct 992 ms 183276 KB [OK, No] n = 1000000000, m1 = 499763, m2 = 500237, t = 3500
97 Correct 795 ms 155932 KB [OK, Yes] n = 1000000000, m1 = 404552, m2 = 404965, t = 5000