oj.uz

답안 #1041654

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1041654 2024-08-02T06:46:06 Z GEN(#11054) Brought Down the Grading Server? (CEOI23_balance) C++17
70 / 100
 659 ms 62984 KB 
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> A;
int B[100005]; // B[val] = id
int C[100005];
int D[100005]; // D[id] = sum
int E[100005]; // current
int N, S;
vector<vector<array<int, 4>>> adj2;
vector<int> path;
void Euler(int c) {
    while(adj2[c].size() > 0) {
        if(adj2[c].back()[1] == 0) {
            adj2[c].pop_back();
            continue;
        }
        int sz = adj2[c].size();
        adj2[c][sz-1][1]--;
        int a = adj2[c][sz-1][2], b = adj2[c][sz-1][3];
        if(adj2[a].size()>b) {
            adj2[a][b][1]--;
        }
        Euler(adj2[c][sz-1][0]);
    }
    path.push_back(c);
}
void addEdge(int u, int v) {
    //cout << "ADD : " << u << ' ' << v << '\n';
    int s1 = adj2[u].size(), s2 = adj2[v].size();
    adj2[u].push_back({v, 1, v, s2});
    adj2[v].push_back({u, 1, u, s1});
}
vector<int> DnC2(int s, int e, int a, int b) {
    int i, j;
    if(s>=e) return {};
    if(s+1==e) {
        vector<int> v;
        for(i=a;i<b;i++) v.push_back(A[s][i]);
        v.erase(unique(v.begin(),v.end()),v.end());
        return v;
    }
    int mid = (s+e)/2;
    vector<int> v1 = DnC2(s, mid, a, b);
    vector<int> v2 = DnC2(mid, e, a, b);
    vector<int> v;
    v.resize(v1.size()+v2.size());
    merge(v1.begin(),v1.end(),v2.begin(),v2.end(),v.begin());
    v.erase(unique(v.begin(),v.end()),v.end());
    return v;
}
vector<vector<array<int, 4>>> V;
void DnC(int s, int e) {
    if(e==s+1) return;
    int i, j;
    vector<int> S = DnC2(0, N, s, e);
    int T = S.size();
    for(i=0;i<T;i++) B[S[i]] = i;
    int mid = (s+e)/2;
    for(i=0;i<T;i++) {
        D[i] = 0;
    }
    for(i=0;i<N;i++) {
        for(j=s;j<e;j++) {
            D[B[A[i][j]]]++;
        }
    }
    adj2.clear();
    adj2.resize(T+N);
    vector<int> v;
    for(i=0;i<T;i++) {
        if(D[i] % 2 == 0) D[i] = 0;
        else v.push_back(i);
    }
    assert(v.size()%2==0);
    int sz = v.size();
    for(i=0;i<sz;i+=2) addEdge(N+v[i], N+v[i+1]);
    v.clear();
    V.clear();
    V.resize(N);
    for(i=0;i<N;i++) {
        for(j=s;j<e;) {
            int pt = j;
            while(pt+1<e&&A[i][j]==A[i][pt+1]) pt++;
            //[j ~ pt]
            V[i].push_back({j, pt, A[i][j], -1});
            j = pt + 1;
        }
        for(j=0;j<V[i].size();j++) {
            int v = V[i][j][1] - V[i][j][0] + 1;
            if(v % 2 == 0) V[i][j][3] = 0;
            if(v % 2 == 1) {
                addEdge(i, N+B[V[i][j][2]]);
            }
        }
    }
    //cout << "Adding Edge done\n";
    //Euler(0);
    vector<vector<array<int, 2>>> adj;
    //cout << s << ' ' << e << " Euler Done\n";
    adj.resize(N);
    for(j=N;j<T+N;j++) {
        path.clear();
        Euler(j);
        for(i=0;i+1<path.size();i++) {
            int x = path[i], y = path[i+1];
            if(x>y)swap(x, y);
            if(x < N && y >= N) {
                adj[x].push_back({y-N, 2*(i % 2)-1});
            }
        }
    }
    for(i=0;i<N;i++) {
        /*cout << i << " : ";
        for(auto n : adj[i]) cout << "("<<n[0]<<", " << n[1] << ") ";
        cout << '\n';*/
        for(auto n : adj[i]) C[n[0]] = n[1];
        int l = s, r = mid;
        for(auto n : V[i]) {
            int a = -1, b = -1;
            int v = n[1] - n[0] + 1;
            if(v%2==0) a = v/2, b=v/2;
            else {
                if(C[B[n[2]]]==1) a = v/2+1, b = v/2;
                else a = v/2, b = v/2+1;
            }
            //cout << n[2] << " : " << a << ' ' << b <<'\n';
            assert(l+a-1<mid&&r+b-1<e);
            for(j=l;j<=l+a-1;j++) A[i][j] = n[2];
            l += a;
            for(j=r;j<=r+b-1;j++) A[i][j] = n[2];
            r += b;
        }
        assert(l == mid && r == e);
    }
    adj.clear();
    DnC(s, mid);
    DnC(mid, e);
}
signed main() {
    //cin.sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T;
    cin >> N >> S >> T;
    A.resize(N);
    int i, j;
    for(i=0;i<N;i++) A[i].resize(S);
    for(i=0;i<N;i++) {
        for(j=0;j<S;j++) cin >> A[i][j];
    }
    for(i=0;i<N;i++) sort(A[i].begin(),A[i].end());
    DnC(0, S);
    for(i=0;i<N;i++) {
        for(j=0;j<S;j++)cout << A[i][j] << ' ';
        cout << '\n';
    }
}

Compilation message

balance.cpp: In function 'void Euler(int)':
balance.cpp:20:26: warning: comparison of integer expressions of different signedness: 'std::vector<std::array<int, 4> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |         if(adj2[a].size()>b) {
      |            ~~~~~~~~~~~~~~^~
balance.cpp: In function 'std::vector<int> DnC2(int, int, int, int)':
balance.cpp:34:12: warning: unused variable 'j' [-Wunused-variable]
   34 |     int i, j;
      |            ^
balance.cpp: In function 'void DnC(int, int)':
balance.cpp:88:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 4> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |         for(j=0;j<V[i].size();j++) {
      |                 ~^~~~~~~~~~~~
balance.cpp:104:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |         for(i=0;i+1<path.size();i++) {
      |                 ~~~^~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Correct
2 Correct 0 ms 348 KB Correct

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 1 ms 348 KB Correct
4 Correct 0 ms 348 KB Correct
5 Correct 0 ms 348 KB Correct
6 Correct 1 ms 348 KB Correct
7 Correct 0 ms 348 KB Correct

Subtask #2-1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 162 ms 39564 KB Correct
2 Correct 141 ms 38708 KB Correct
3 Correct 117 ms 33796 KB Correct
4 Correct 74 ms 33420 KB Correct
5 Correct 140 ms 38180 KB Correct
6 Correct 141 ms 40620 KB Correct
7 Correct 159 ms 34036 KB Correct
8 Correct 113 ms 41956 KB Correct
9 Correct 120 ms 41808 KB Correct
10 Correct 86 ms 41036 KB Correct
11 Correct 86 ms 40760 KB Correct

Subtask #2-2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 162 ms 39564 KB Correct
2 Correct 141 ms 38708 KB Correct
3 Correct 117 ms 33796 KB Correct
4 Correct 74 ms 33420 KB Correct
5 Correct 140 ms 38180 KB Correct
6 Correct 141 ms 40620 KB Correct
7 Correct 159 ms 34036 KB Correct
8 Correct 113 ms 41956 KB Correct
9 Correct 120 ms 41808 KB Correct
10 Correct 86 ms 41036 KB Correct
11 Correct 86 ms 40760 KB Correct
12 Correct 137 ms 39540 KB Correct
13 Correct 118 ms 38724 KB Correct
14 Correct 116 ms 33792 KB Correct
15 Correct 69 ms 33320 KB Correct
16 Correct 110 ms 37988 KB Correct
17 Correct 137 ms 40684 KB Correct
18 Correct 125 ms 34036 KB Correct
19 Correct 112 ms 41968 KB Correct
20 Correct 124 ms 41636 KB Correct
21 Correct 87 ms 41140 KB Correct
22 Correct 91 ms 40820 KB Correct
23 Correct 134 ms 42964 KB Correct
24 Correct 82 ms 35288 KB Correct
25 Correct 128 ms 39008 KB Correct

Subtask #2-3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 1 ms 348 KB Correct
4 Correct 0 ms 348 KB Correct
5 Correct 0 ms 348 KB Correct
6 Correct 1 ms 348 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 162 ms 39564 KB Correct
9 Correct 141 ms 38708 KB Correct
10 Correct 117 ms 33796 KB Correct
11 Correct 74 ms 33420 KB Correct
12 Correct 140 ms 38180 KB Correct
13 Correct 141 ms 40620 KB Correct
14 Correct 159 ms 34036 KB Correct
15 Correct 113 ms 41956 KB Correct
16 Correct 120 ms 41808 KB Correct
17 Correct 86 ms 41036 KB Correct
18 Correct 86 ms 40760 KB Correct
19 Correct 137 ms 39540 KB Correct
20 Correct 118 ms 38724 KB Correct
21 Correct 116 ms 33792 KB Correct
22 Correct 69 ms 33320 KB Correct
23 Correct 110 ms 37988 KB Correct
24 Correct 137 ms 40684 KB Correct
25 Correct 125 ms 34036 KB Correct
26 Correct 112 ms 41968 KB Correct
27 Correct 124 ms 41636 KB Correct
28 Correct 87 ms 41140 KB Correct
29 Correct 91 ms 40820 KB Correct
30 Correct 134 ms 42964 KB Correct
31 Correct 82 ms 35288 KB Correct
32 Correct 128 ms 39008 KB Correct
33 Correct 1 ms 348 KB Correct
34 Correct 0 ms 348 KB Correct
35 Correct 0 ms 348 KB Correct
36 Correct 0 ms 348 KB Correct
37 Correct 0 ms 344 KB Correct
38 Correct 0 ms 348 KB Correct
39 Correct 0 ms 344 KB Correct
40 Correct 130 ms 39444 KB Correct
41 Correct 111 ms 38720 KB Correct
42 Correct 101 ms 33796 KB Correct
43 Correct 70 ms 33420 KB Correct
44 Correct 108 ms 38116 KB Correct
45 Correct 147 ms 40564 KB Correct
46 Correct 142 ms 34028 KB Correct
47 Correct 121 ms 42024 KB Correct
48 Correct 113 ms 41640 KB Correct
49 Correct 83 ms 41084 KB Correct
50 Correct 84 ms 40960 KB Correct
51 Correct 136 ms 42852 KB Correct
52 Correct 84 ms 35188 KB Correct
53 Correct 129 ms 39000 KB Correct
54 Correct 67 ms 23388 KB Correct
55 Correct 2 ms 1112 KB Correct

Subtask #3-1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 9 ms 1116 KB Correct
3 Correct 5 ms 348 KB Correct
4 Correct 5 ms 1372 KB Correct
5 Correct 3 ms 1624 KB Correct
6 Correct 5 ms 2412 KB Correct
7 Correct 5 ms 1372 KB Correct
8 Correct 8 ms 1628 KB Correct
9 Correct 7 ms 1372 KB Correct
10 Correct 7 ms 1912 KB Correct
11 Correct 8 ms 1628 KB Correct
12 Correct 5 ms 2396 KB Correct
13 Correct 4 ms 2644 KB Correct
14 Correct 4 ms 2396 KB Correct

Subtask #3-2
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 9 ms 1116 KB Correct
3 Correct 5 ms 348 KB Correct
4 Correct 5 ms 1372 KB Correct
5 Correct 3 ms 1624 KB Correct
6 Correct 5 ms 2412 KB Correct
7 Correct 5 ms 1372 KB Correct
8 Correct 8 ms 1628 KB Correct
9 Correct 7 ms 1372 KB Correct
10 Correct 7 ms 1912 KB Correct
11 Correct 8 ms 1628 KB Correct
12 Correct 5 ms 2396 KB Correct
13 Correct 4 ms 2644 KB Correct
14 Correct 4 ms 2396 KB Correct
15 Correct 1 ms 348 KB Correct
16 Correct 10 ms 1112 KB Correct
17 Correct 4 ms 348 KB Correct
18 Correct 5 ms 1536 KB Correct
19 Correct 3 ms 1628 KB Correct
20 Correct 5 ms 2396 KB Correct
21 Correct 5 ms 1372 KB Correct
22 Correct 7 ms 1668 KB Correct
23 Correct 7 ms 1372 KB Correct
24 Correct 7 ms 1880 KB Correct
25 Correct 5 ms 1628 KB Correct
26 Correct 5 ms 2396 KB Correct
27 Correct 4 ms 2396 KB Correct
28 Correct 6 ms 2396 KB Correct
29 Incorrect 8 ms 860 KB maximum and minimum number of simultaneously evaluated submissions for any single task differ more than one
30 Halted 0 ms 0 KB -

Subtask #3-3
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 9 ms 1116 KB Correct
3 Correct 5 ms 348 KB Correct
4 Correct 5 ms 1372 KB Correct
5 Correct 3 ms 1624 KB Correct
6 Correct 5 ms 2412 KB Correct
7 Correct 5 ms 1372 KB Correct
8 Correct 8 ms 1628 KB Correct
9 Correct 7 ms 1372 KB Correct
10 Correct 7 ms 1912 KB Correct
11 Correct 8 ms 1628 KB Correct
12 Correct 5 ms 2396 KB Correct
13 Correct 4 ms 2644 KB Correct
14 Correct 4 ms 2396 KB Correct
15 Correct 1 ms 348 KB Correct
16 Correct 10 ms 1112 KB Correct
17 Correct 4 ms 348 KB Correct
18 Correct 5 ms 1536 KB Correct
19 Correct 3 ms 1628 KB Correct
20 Correct 5 ms 2396 KB Correct
21 Correct 5 ms 1372 KB Correct
22 Correct 7 ms 1668 KB Correct
23 Correct 7 ms 1372 KB Correct
24 Correct 7 ms 1880 KB Correct
25 Correct 5 ms 1628 KB Correct
26 Correct 5 ms 2396 KB Correct
27 Correct 4 ms 2396 KB Correct
28 Correct 6 ms 2396 KB Correct
29 Incorrect 8 ms 860 KB maximum and minimum number of simultaneously evaluated submissions for any single task differ more than one
30 Halted 0 ms 0 KB -

Subtask #4-1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 162 ms 39564 KB Correct
2 Correct 141 ms 38708 KB Correct
3 Correct 117 ms 33796 KB Correct
4 Correct 74 ms 33420 KB Correct
5 Correct 140 ms 38180 KB Correct
6 Correct 141 ms 40620 KB Correct
7 Correct 159 ms 34036 KB Correct
8 Correct 113 ms 41956 KB Correct
9 Correct 120 ms 41808 KB Correct
10 Correct 86 ms 41036 KB Correct
11 Correct 86 ms 40760 KB Correct
12 Correct 0 ms 344 KB Correct
13 Correct 9 ms 1116 KB Correct
14 Correct 5 ms 348 KB Correct
15 Correct 5 ms 1372 KB Correct
16 Correct 3 ms 1624 KB Correct
17 Correct 5 ms 2412 KB Correct
18 Correct 5 ms 1372 KB Correct
19 Correct 8 ms 1628 KB Correct
20 Correct 7 ms 1372 KB Correct
21 Correct 7 ms 1912 KB Correct
22 Correct 8 ms 1628 KB Correct
23 Correct 5 ms 2396 KB Correct
24 Correct 4 ms 2644 KB Correct
25 Correct 4 ms 2396 KB Correct
26 Correct 133 ms 39512 KB Correct
27 Correct 117 ms 38724 KB Correct
28 Correct 117 ms 33792 KB Correct
29 Correct 73 ms 33420 KB Correct
30 Correct 112 ms 38176 KB Correct
31 Correct 132 ms 40640 KB Correct
32 Correct 131 ms 34020 KB Correct
33 Correct 108 ms 42024 KB Correct
34 Correct 110 ms 41644 KB Correct
35 Correct 84 ms 41080 KB Correct
36 Correct 81 ms 40828 KB Correct
37 Correct 0 ms 348 KB Correct
38 Correct 9 ms 1116 KB Correct
39 Correct 4 ms 348 KB Correct
40 Correct 5 ms 1492 KB Correct
41 Correct 3 ms 1628 KB Correct
42 Correct 5 ms 2396 KB Correct
43 Correct 5 ms 1372 KB Correct
44 Correct 7 ms 1672 KB Correct
45 Correct 7 ms 1372 KB Correct
46 Correct 7 ms 1884 KB Correct
47 Correct 4 ms 1628 KB Correct
48 Correct 5 ms 2396 KB Correct
49 Correct 4 ms 2492 KB Correct
50 Correct 4 ms 2396 KB Correct
51 Correct 634 ms 60368 KB Correct
52 Correct 585 ms 13876 KB Correct
53 Correct 44 ms 1124 KB Correct
54 Correct 153 ms 12484 KB Correct
55 Correct 419 ms 11252 KB Correct
56 Correct 537 ms 49648 KB Correct
57 Correct 659 ms 62984 KB Correct
58 Correct 270 ms 4180 KB Correct
59 Correct 204 ms 3412 KB Correct
60 Correct 457 ms 43064 KB Correct
61 Correct 591 ms 46916 KB Correct
62 Correct 206 ms 44256 KB Correct
63 Correct 217 ms 44268 KB Correct
64 Correct 198 ms 44244 KB Correct
65 Correct 202 ms 44200 KB Correct
66 Correct 201 ms 44228 KB Correct
67 Correct 220 ms 44736 KB Correct
68 Correct 208 ms 44240 KB Correct
69 Correct 215 ms 44408 KB Correct
70 Correct 253 ms 29556 KB Correct
71 Correct 271 ms 29084 KB Correct

Subtask #4-2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 162 ms 39564 KB Correct
2 Correct 141 ms 38708 KB Correct
3 Correct 117 ms 33796 KB Correct
4 Correct 74 ms 33420 KB Correct
5 Correct 140 ms 38180 KB Correct
6 Correct 141 ms 40620 KB Correct
7 Correct 159 ms 34036 KB Correct
8 Correct 113 ms 41956 KB Correct
9 Correct 120 ms 41808 KB Correct
10 Correct 86 ms 41036 KB Correct
11 Correct 86 ms 40760 KB Correct
12 Correct 137 ms 39540 KB Correct
13 Correct 118 ms 38724 KB Correct
14 Correct 116 ms 33792 KB Correct
15 Correct 69 ms 33320 KB Correct
16 Correct 110 ms 37988 KB Correct
17 Correct 137 ms 40684 KB Correct
18 Correct 125 ms 34036 KB Correct
19 Correct 112 ms 41968 KB Correct
20 Correct 124 ms 41636 KB Correct
21 Correct 87 ms 41140 KB Correct
22 Correct 91 ms 40820 KB Correct
23 Correct 134 ms 42964 KB Correct
24 Correct 82 ms 35288 KB Correct
25 Correct 128 ms 39008 KB Correct
26 Correct 0 ms 344 KB Correct
27 Correct 9 ms 1116 KB Correct
28 Correct 5 ms 348 KB Correct
29 Correct 5 ms 1372 KB Correct
30 Correct 3 ms 1624 KB Correct
31 Correct 5 ms 2412 KB Correct
32 Correct 5 ms 1372 KB Correct
33 Correct 8 ms 1628 KB Correct
34 Correct 7 ms 1372 KB Correct
35 Correct 7 ms 1912 KB Correct
36 Correct 8 ms 1628 KB Correct
37 Correct 5 ms 2396 KB Correct
38 Correct 4 ms 2644 KB Correct
39 Correct 4 ms 2396 KB Correct
40 Correct 1 ms 348 KB Correct
41 Correct 10 ms 1112 KB Correct
42 Correct 4 ms 348 KB Correct
43 Correct 5 ms 1536 KB Correct
44 Correct 3 ms 1628 KB Correct
45 Correct 5 ms 2396 KB Correct
46 Correct 5 ms 1372 KB Correct
47 Correct 7 ms 1668 KB Correct
48 Correct 7 ms 1372 KB Correct
49 Correct 7 ms 1880 KB Correct
50 Correct 5 ms 1628 KB Correct
51 Correct 5 ms 2396 KB Correct
52 Correct 4 ms 2396 KB Correct
53 Correct 6 ms 2396 KB Correct
54 Incorrect 8 ms 860 KB maximum and minimum number of simultaneously evaluated submissions for any single task differ more than one
55 Halted 0 ms 0 KB -

Subtask #4-3
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 0 ms 348 KB Correct
4 Correct 0 ms 348 KB Correct
5 Correct 1 ms 348 KB Correct
6 Correct 0 ms 348 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 1 ms 348 KB Correct
9 Correct 0 ms 348 KB Correct
10 Correct 162 ms 39564 KB Correct
11 Correct 141 ms 38708 KB Correct
12 Correct 117 ms 33796 KB Correct
13 Correct 74 ms 33420 KB Correct
14 Correct 140 ms 38180 KB Correct
15 Correct 141 ms 40620 KB Correct
16 Correct 159 ms 34036 KB Correct
17 Correct 113 ms 41956 KB Correct
18 Correct 120 ms 41808 KB Correct
19 Correct 86 ms 41036 KB Correct
20 Correct 86 ms 40760 KB Correct
21 Correct 137 ms 39540 KB Correct
22 Correct 118 ms 38724 KB Correct
23 Correct 116 ms 33792 KB Correct
24 Correct 69 ms 33320 KB Correct
25 Correct 110 ms 37988 KB Correct
26 Correct 137 ms 40684 KB Correct
27 Correct 125 ms 34036 KB Correct
28 Correct 112 ms 41968 KB Correct
29 Correct 124 ms 41636 KB Correct
30 Correct 87 ms 41140 KB Correct
31 Correct 91 ms 40820 KB Correct
32 Correct 134 ms 42964 KB Correct
33 Correct 82 ms 35288 KB Correct
34 Correct 128 ms 39008 KB Correct
35 Correct 1 ms 348 KB Correct
36 Correct 0 ms 348 KB Correct
37 Correct 0 ms 348 KB Correct
38 Correct 0 ms 348 KB Correct
39 Correct 0 ms 344 KB Correct
40 Correct 0 ms 348 KB Correct
41 Correct 0 ms 344 KB Correct
42 Correct 130 ms 39444 KB Correct
43 Correct 111 ms 38720 KB Correct
44 Correct 101 ms 33796 KB Correct
45 Correct 70 ms 33420 KB Correct
46 Correct 108 ms 38116 KB Correct
47 Correct 147 ms 40564 KB Correct
48 Correct 142 ms 34028 KB Correct
49 Correct 121 ms 42024 KB Correct
50 Correct 113 ms 41640 KB Correct
51 Correct 83 ms 41084 KB Correct
52 Correct 84 ms 40960 KB Correct
53 Correct 136 ms 42852 KB Correct
54 Correct 84 ms 35188 KB Correct
55 Correct 129 ms 39000 KB Correct
56 Correct 67 ms 23388 KB Correct
57 Correct 2 ms 1112 KB Correct
58 Correct 0 ms 344 KB Correct
59 Correct 9 ms 1116 KB Correct
60 Correct 5 ms 348 KB Correct
61 Correct 5 ms 1372 KB Correct
62 Correct 3 ms 1624 KB Correct
63 Correct 5 ms 2412 KB Correct
64 Correct 5 ms 1372 KB Correct
65 Correct 8 ms 1628 KB Correct
66 Correct 7 ms 1372 KB Correct
67 Correct 7 ms 1912 KB Correct
68 Correct 8 ms 1628 KB Correct
69 Correct 5 ms 2396 KB Correct
70 Correct 4 ms 2644 KB Correct
71 Correct 4 ms 2396 KB Correct
72 Correct 1 ms 348 KB Correct
73 Correct 10 ms 1112 KB Correct
74 Correct 4 ms 348 KB Correct
75 Correct 5 ms 1536 KB Correct
76 Correct 3 ms 1628 KB Correct
77 Correct 5 ms 2396 KB Correct
78 Correct 5 ms 1372 KB Correct
79 Correct 7 ms 1668 KB Correct
80 Correct 7 ms 1372 KB Correct
81 Correct 7 ms 1880 KB Correct
82 Correct 5 ms 1628 KB Correct
83 Correct 5 ms 2396 KB Correct
84 Correct 4 ms 2396 KB Correct
85 Correct 6 ms 2396 KB Correct
86 Incorrect 8 ms 860 KB maximum and minimum number of simultaneously evaluated submissions for any single task differ more than one
87 Halted 0 ms 0 KB -