oj.uz

Submission #205212

# Submission time Handle Problem Language Result Execution time Memory
205212 2020-02-28T10:20:31 Z egekabas Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1272 KB 
#include <bits/stdc++.h>
#include "meetings.h"
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long   ll;
typedef unsigned long long   ull;
typedef long double ld;
typedef pair<ll, ll>    pll;
typedef pair<ull, ull>    pull;
typedef pair<int, int>  pii;
typedef pair<ld, ld>  pld;
int p[2009];
void calc(int root, vector<int> all){
    if(all.size() <= 1) return;
    vector<pair<vector<int>, int>> groups;
    for(auto u : all){
        if(u == root) continue;
        int put = 0;
        for(auto &v : groups){
            if(v.ss == u){
                put = 1;
                v.ff.pb(u);
                continue;
            }
            int tmp = Query(root, u, v.ss);
            if(tmp == root) continue;
            put = 1;
            v.ss = tmp;
            v.ff.pb(u);
        }
        if(put == 0){
            groups.pb({{u}, u});
        }
    }
    for(auto v : groups){
        p[v.ss] = root;
        calc(v.ss, v.ff);
    }
        
}

void Solve(int n){
    vector<int> all;
    for(int i = 0; i < n; ++i)
        all.pb(i);
    calc(0, all);
    for(int i = 1; i < n; ++i)
        Bridge(min(i, p[i]), max(i, p[i]));
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 248 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 5 ms 248 KB Output is correct
9 Correct 5 ms 424 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 4 ms 248 KB Output is correct
12 Correct 5 ms 380 KB Output is correct
13 Correct 5 ms 380 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 248 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 5 ms 248 KB Output is correct
9 Correct 5 ms 424 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 4 ms 248 KB Output is correct
12 Correct 5 ms 380 KB Output is correct
13 Correct 5 ms 380 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 380 KB Output is correct
17 Correct 6 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 248 KB Output is correct
20 Correct 5 ms 252 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 304 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 248 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 5 ms 248 KB Output is correct
9 Correct 5 ms 424 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 4 ms 248 KB Output is correct
12 Correct 5 ms 380 KB Output is correct
13 Correct 5 ms 380 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 380 KB Output is correct
17 Correct 6 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 248 KB Output is correct
20 Correct 5 ms 252 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 304 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 30 ms 376 KB Output is correct
28 Correct 22 ms 376 KB Output is correct
29 Correct 27 ms 372 KB Output is correct
30 Correct 28 ms 376 KB Output is correct
31 Correct 18 ms 376 KB Output is correct
32 Correct 28 ms 376 KB Output is correct
33 Correct 34 ms 504 KB Output is correct
34 Correct 37 ms 504 KB Output is correct
35 Correct 33 ms 376 KB Output is correct
36 Correct 22 ms 504 KB Output is correct
37 Correct 94 ms 632 KB Output is correct
38 Correct 147 ms 888 KB Output is correct
39 Correct 171 ms 1272 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2869 ms 864 KB Time limit exceeded
2 Halted 0 ms 0 KB -