oj.uz

Submission #205210

# Submission time Handle Problem Language Result Execution time Memory
205210 2020-02-28T10:13:15 Z egekabas Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1484 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;
    for(auto it = all.begin(); it < all.end(); ++it)
        if(*it == root){
            all.erase(it);
            break;
        }
    vector<vector<int>> groups;
    for(auto u : all){
        int put = 0;
        for(auto &v : groups){
            if(Query(v.front(), u, root) != root){
                v.pb(u);
                put = 1;
                break;
            }
        }
        if(put == 0){
            groups.pb({u});
        }
    }
    for(auto v : groups){
        int nextroot = v[0];
        for(int i = 1; i < v.size(); ++i)
            if(v[i] != nextroot)
                nextroot = Query(root, nextroot, v[i]);
        p[nextroot] = root;
        calc(nextroot, v);
    }
}

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]));
}

Compilation message

meetings.cpp: In function 'void calc(int, std::vector<int>)':
meetings.cpp:39:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 1; i < v.size(); ++i)
                        ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 252 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 248 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 4 ms 248 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 248 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 5 ms 248 KB Output is correct
10 Correct 5 ms 248 KB Output is correct
11 Correct 5 ms 308 KB Output is correct
12 Correct 5 ms 248 KB Output is correct
13 Correct 4 ms 248 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 248 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 248 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 248 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 376 KB Output is correct
24 Correct 6 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 6 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 252 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 248 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 4 ms 248 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 248 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 5 ms 248 KB Output is correct
10 Correct 5 ms 248 KB Output is correct
11 Correct 5 ms 308 KB Output is correct
12 Correct 5 ms 248 KB Output is correct
13 Correct 4 ms 248 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 248 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 248 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 248 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 376 KB Output is correct
24 Correct 6 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 6 ms 376 KB Output is correct
27 Correct 22 ms 376 KB Output is correct
28 Correct 17 ms 380 KB Output is correct
29 Correct 22 ms 504 KB Output is correct
30 Correct 30 ms 504 KB Output is correct
31 Correct 20 ms 376 KB Output is correct
32 Correct 14 ms 376 KB Output is correct
33 Correct 15 ms 376 KB Output is correct
34 Correct 15 ms 376 KB Output is correct
35 Correct 14 ms 376 KB Output is correct
36 Correct 26 ms 376 KB Output is correct
37 Correct 177 ms 632 KB Output is correct
38 Correct 290 ms 1016 KB Output is correct
39 Correct 349 ms 1016 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1241 ms 888 KB Output is correct
2 Correct 1525 ms 768 KB Output is correct
3 Correct 1296 ms 888 KB Output is correct
4 Correct 1830 ms 1016 KB Output is correct
5 Correct 1758 ms 972 KB Output is correct
6 Correct 1339 ms 888 KB Output is correct
7 Correct 616 ms 1016 KB Output is correct
8 Correct 612 ms 632 KB Output is correct
9 Correct 609 ms 760 KB Output is correct
10 Correct 615 ms 760 KB Output is correct
11 Correct 644 ms 760 KB Output is correct
12 Execution timed out 3080 ms 1484 KB Time limit exceeded
13 Halted 0 ms 0 KB -