oj.uz

답안 #795334

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
795334 2023-07-27T08:26:12 Z vjudge1 Council (JOI23_council) C++17
41 / 100
 4000 ms 61764 KB 

// Author : حسن

#include <bits/stdc++.h>



using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 3e5 + 9 , mod = 1e9 + 7;
ll c[N] = {} , d[N] = {} , a[N][22] = {}, b[N] = {}  , us[N] , dp[N * 4] = {};


void solve(){
    ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
    cin>>n>>m;
    //cout<<pow(2 , 8)<<"\n";
    for(i = 1;i  <= n; i++)
        for(j = 1; j <= m; j++)
            cin>>a[i][j] , b[j] += a[i][j];
    y = n/ 2;
    for(j = 1; j <= m; j++)
        s += b[j] >= y;
   // cout<<s<<"\n";
   //cout<<pow(2 , 5)<<"\n";
    if(n <= 3000){
        for(i = 1; i <= n; i++){
            mx = 0;
            for(j = 1; j <= m; j++){
                b[j] -= a[i][j];
                if(a[i][j] == 1 && b[j] == y - 1)
                    s--;
            }
            for(x = 1; x <= n; x++){
                if(x == i)
                continue;
                for(j = 1; j <= m; j++){
                        b[j] -= a[x][j];
                if(a[x][j] == 1 && b[j] == y - 1)
                    s--;
                }
                mx = max(mx , s);
                for(j = 1; j <= m; j++){
                        b[j] += a[x][j];
                if(a[x][j] == 1 && b[j] == y)
                    s++;
                }
            }

                for(j = 1; j <= m; j++){
                        b[j] += a[i][j];
                if(a[i][j] == 1 && b[j] == y)
                    s++;
                }
             //   cout<<s<<"\n";
           cout<<mx<<"\n";
        }
    }else {
        set<int>st;
        for(i = 1; i <= n; i++){
            for(j = 1; j <= m; j++){
                b[j] -= a[i][j];
                if(a[i][j] == 1 && b[j] == y - 1)
                    s--;
            }
            c[i] = s;
            x = 0;
            for(j = 1; j <= m; j++)
                if(b[j] == y)
                    x += (1 << j);
            us[i] =  x;
            st.insert(x);
            for(j = 1; j <= m; j++){
                        b[j] += a[i][j];
                if(a[i][j] == 1 && b[j] == y)
                    s++;
                }
        }
        //cout<<c[1]<<" "<<us[1]<<"\n";
        for(auto it : st)
            dp[it] = 1e9;
        for(i = 1; i <= n; i++)
            b[i] = 0;
        set<int>st1;
        for(i = 1; i <= n; i++){
            if(i != 1)
            b[i] =  c[i] - dp[us[i]];
            s = 0;
            for(j =1 ; j <= m; j++){
                if(a[i][j])
                s += (1 << j);
            }
            if(st1.find(s) != st1.end())
                continue;
            st1.insert(s);

            for(auto it : st){
                    s = 0;
                for(j = 1; j <= m; j++){
                    if((((1 << j) & it) != 0) && a[i][j])
                        s++;
                }
                dp[it] = min(dp[it] , s);
            }
        }
        for(auto it : st)
            dp[it] = 1e9;
            st1.clear();
        for(i = n; i >= 1; i--){
            if(i == 1)
                b[i] = c[i] - dp[us[i]];
            //if(i != n)
            b[i]=  max(b[i] ,  c[i] - dp[us[i]]);
            s = 0;
            for(j =1 ; j <= m; j++){
                if(a[i][j])
                s += (1 << j);
            }
            if(st1.find(s) != st1.end())
                continue;
            st1.insert(s);
            for(auto it : st){
                    s = 0;
                for(j = 1; j <= m; j++){
                    if((((1 << j) & it) != 0) && a[i][j])
                        s++;
                }
                dp[it] = min(dp[it] , s);
            }
        }
        for(i = 1; i <= n; i++)
            cout<<b[i]<<"\n";
    }
}

int main(){

     TL;
    /*
     #ifndef ONLINE_JUDGE
     freopen("input.txt", "r", stdin);
     freopen("output.txt", "w", stdout);
     #endif
     */
int t = 1;
//cin>>t;

while(t--)
     {
     solve();
     }

}
// Author : حسن

Compilation message

council.cpp: In function 'void solve()':
council.cpp:123:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  123 |         for(auto it : st)
      |         ^~~
council.cpp:125:13: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  125 |             st1.clear();
      |             ^~~
council.cpp:32:8: warning: unused variable 'q' [-Wunused-variable]
   32 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |        ^
council.cpp:32:28: warning: unused variable 'z' [-Wunused-variable]
   32 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                            ^
council.cpp:32:40: warning: unused variable 'f' [-Wunused-variable]
   32 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                        ^
council.cpp:32:43: warning: unused variable 'l' [-Wunused-variable]
   32 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                           ^
council.cpp:32:47: warning: unused variable 'r' [-Wunused-variable]
   32 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                               ^
council.cpp:32:51: warning: unused variable 'k' [-Wunused-variable]
   32 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                   ^
council.cpp:32:63: warning: unused variable 'mn' [-Wunused-variable]
   32 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                               ^~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 5 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 10 ms 404 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 13 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 2 ms 328 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 320 KB Output is correct
31 Correct 4 ms 328 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 7 ms 340 KB Output is correct
41 Correct 1 ms 324 KB Output is correct
42 Correct 0 ms 328 KB Output is correct
43 Correct 1 ms 328 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 328 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 5 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 10 ms 404 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 13 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 2 ms 328 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 320 KB Output is correct
31 Correct 4 ms 328 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 7 ms 340 KB Output is correct
41 Correct 1 ms 324 KB Output is correct
42 Correct 0 ms 328 KB Output is correct
43 Correct 1 ms 328 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 328 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 337 ms 964 KB Output is correct
52 Correct 373 ms 980 KB Output is correct
53 Correct 1038 ms 980 KB Output is correct
54 Correct 1160 ms 980 KB Output is correct
55 Correct 107 ms 860 KB Output is correct
56 Correct 1006 ms 952 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 83 ms 60376 KB Output is correct
3 Correct 88 ms 60284 KB Output is correct
4 Correct 61 ms 60136 KB Output is correct
5 Correct 92 ms 60360 KB Output is correct
6 Correct 75 ms 60108 KB Output is correct
7 Correct 82 ms 60340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 396 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 110 ms 860 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 83 ms 60376 KB Output is correct
3 Correct 88 ms 60284 KB Output is correct
4 Correct 61 ms 60136 KB Output is correct
5 Correct 92 ms 60360 KB Output is correct
6 Correct 75 ms 60108 KB Output is correct
7 Correct 82 ms 60340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 396 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 110 ms 860 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 253 ms 60520 KB Output is correct
21 Correct 234 ms 60064 KB Output is correct
22 Correct 236 ms 60140 KB Output is correct
23 Correct 188 ms 60428 KB Output is correct
24 Correct 192 ms 60052 KB Output is correct
25 Correct 277 ms 60168 KB Output is correct
26 Correct 414 ms 60160 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 328 KB Output is correct
29 Correct 1 ms 300 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 4 ms 332 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 2 ms 328 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 324 KB Output is correct
45 Correct 7 ms 396 KB Output is correct

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 83 ms 60376 KB Output is correct
3 Correct 88 ms 60284 KB Output is correct
4 Correct 61 ms 60136 KB Output is correct
5 Correct 92 ms 60360 KB Output is correct
6 Correct 75 ms 60108 KB Output is correct
7 Correct 82 ms 60340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 396 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 110 ms 860 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 253 ms 60520 KB Output is correct
21 Correct 234 ms 60064 KB Output is correct
22 Correct 236 ms 60140 KB Output is correct
23 Correct 188 ms 60428 KB Output is correct
24 Correct 192 ms 60052 KB Output is correct
25 Correct 277 ms 60168 KB Output is correct
26 Correct 414 ms 60160 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 328 KB Output is correct
29 Correct 1 ms 300 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 4 ms 332 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 2 ms 328 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 324 KB Output is correct
45 Correct 7 ms 396 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 2000 ms 61260 KB Output is correct
48 Correct 803 ms 61248 KB Output is correct
49 Correct 792 ms 61292 KB Output is correct
50 Correct 236 ms 61280 KB Output is correct
51 Correct 285 ms 61024 KB Output is correct
52 Correct 394 ms 61764 KB Output is correct
53 Execution timed out 4035 ms 61532 KB Time limit exceeded
54 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 83 ms 60376 KB Output is correct
3 Correct 88 ms 60284 KB Output is correct
4 Correct 61 ms 60136 KB Output is correct
5 Correct 92 ms 60360 KB Output is correct
6 Correct 75 ms 60108 KB Output is correct
7 Correct 82 ms 60340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 396 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 110 ms 860 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 253 ms 60520 KB Output is correct
21 Correct 234 ms 60064 KB Output is correct
22 Correct 236 ms 60140 KB Output is correct
23 Correct 188 ms 60428 KB Output is correct
24 Correct 192 ms 60052 KB Output is correct
25 Correct 277 ms 60168 KB Output is correct
26 Correct 414 ms 60160 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 328 KB Output is correct
29 Correct 1 ms 300 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 4 ms 332 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 2 ms 328 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 324 KB Output is correct
45 Correct 7 ms 396 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 2000 ms 61260 KB Output is correct
48 Correct 803 ms 61248 KB Output is correct
49 Correct 792 ms 61292 KB Output is correct
50 Correct 236 ms 61280 KB Output is correct
51 Correct 285 ms 61024 KB Output is correct
52 Correct 394 ms 61764 KB Output is correct
53 Execution timed out 4035 ms 61532 KB Time limit exceeded
54 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 5 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 10 ms 404 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 13 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 2 ms 328 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 320 KB Output is correct
31 Correct 4 ms 328 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 7 ms 340 KB Output is correct
41 Correct 1 ms 324 KB Output is correct
42 Correct 0 ms 328 KB Output is correct
43 Correct 1 ms 328 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 328 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 337 ms 964 KB Output is correct
52 Correct 373 ms 980 KB Output is correct
53 Correct 1038 ms 980 KB Output is correct
54 Correct 1160 ms 980 KB Output is correct
55 Correct 107 ms 860 KB Output is correct
56 Correct 1006 ms 952 KB Output is correct
57 Correct 1 ms 324 KB Output is correct
58 Correct 83 ms 60376 KB Output is correct
59 Correct 88 ms 60284 KB Output is correct
60 Correct 61 ms 60136 KB Output is correct
61 Correct 92 ms 60360 KB Output is correct
62 Correct 75 ms 60108 KB Output is correct
63 Correct 82 ms 60340 KB Output is correct
64 Correct 0 ms 340 KB Output is correct
65 Correct 0 ms 340 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 1 ms 340 KB Output is correct
68 Correct 1 ms 396 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 1 ms 340 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 110 ms 860 KB Output is correct
74 Correct 1 ms 340 KB Output is correct
75 Correct 0 ms 340 KB Output is correct
76 Correct 253 ms 60520 KB Output is correct
77 Correct 234 ms 60064 KB Output is correct
78 Correct 236 ms 60140 KB Output is correct
79 Correct 188 ms 60428 KB Output is correct
80 Correct 192 ms 60052 KB Output is correct
81 Correct 277 ms 60168 KB Output is correct
82 Correct 414 ms 60160 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 0 ms 328 KB Output is correct
85 Correct 1 ms 300 KB Output is correct
86 Correct 0 ms 340 KB Output is correct
87 Correct 1 ms 340 KB Output is correct
88 Correct 1 ms 340 KB Output is correct
89 Correct 1 ms 340 KB Output is correct
90 Correct 1 ms 340 KB Output is correct
91 Correct 1 ms 340 KB Output is correct
92 Correct 4 ms 332 KB Output is correct
93 Correct 1 ms 340 KB Output is correct
94 Correct 1 ms 340 KB Output is correct
95 Correct 1 ms 340 KB Output is correct
96 Correct 2 ms 328 KB Output is correct
97 Correct 1 ms 340 KB Output is correct
98 Correct 1 ms 340 KB Output is correct
99 Correct 1 ms 340 KB Output is correct
100 Correct 1 ms 324 KB Output is correct
101 Correct 7 ms 396 KB Output is correct
102 Correct 1 ms 340 KB Output is correct
103 Correct 2000 ms 61260 KB Output is correct
104 Correct 803 ms 61248 KB Output is correct
105 Correct 792 ms 61292 KB Output is correct
106 Correct 236 ms 61280 KB Output is correct
107 Correct 285 ms 61024 KB Output is correct
108 Correct 394 ms 61764 KB Output is correct
109 Execution timed out 4035 ms 61532 KB Time limit exceeded
110 Halted 0 ms 0 KB -