oj.uz

Submission #205222

# Submission time Handle Problem Language Result Execution time Memory
205222 2020-02-28T10:34:50 Z egekabas Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1400 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){
    vector<vector<int>> vec;
    vector<int> lead;
    for(auto u : all){
        if(u == root) continue;
        int put = 0;
        for(int i = 0; i < lead.size(); ++i){
            if(lead[i] == u){
                vec[i].pb(u);
                put = 1;
                break;
            }
            int tmp = Query(u, lead[i], root);
            if(tmp == root) continue;
            lead[i] = tmp;
            vec[i].pb(u);
            put = 1;
            break;
        }
        if(put == 0){
            lead.pb(u);
            vec.pb({u});
        }
    }
    for(int i = 0; i < lead.size(); ++i){
        p[lead[i]] = root;
        if(vec[i].size() > 1)
            calc(lead[i], vec[i]);
        vec[i].clear();
    }
        
}

void Solve(int n){
    vector<int> all;
    for(int i = 0; i < n; ++i)
        all.pb(i);
    if(all.size() > 1)
        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:22:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i < lead.size(); ++i){
                        ~~^~~~~~~~~~~~~
meetings.cpp:40:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < lead.size(); ++i){
                    ~~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 248 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 5 ms 248 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 248 KB Output is correct
9 Correct 5 ms 248 KB Output is correct
10 Correct 5 ms 380 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 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 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 6 ms 376 KB Output is correct
19 Correct 5 ms 248 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 6 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 248 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 248 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 5 ms 248 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 248 KB Output is correct
9 Correct 5 ms 248 KB Output is correct
10 Correct 5 ms 380 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 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 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 6 ms 376 KB Output is correct
19 Correct 5 ms 248 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 6 ms 376 KB Output is correct
26 Correct 6 ms 376 KB Output is correct
27 Correct 14 ms 376 KB Output is correct
28 Correct 11 ms 376 KB Output is correct
29 Correct 15 ms 376 KB Output is correct
30 Correct 16 ms 376 KB Output is correct
31 Correct 12 ms 376 KB Output is correct
32 Correct 11 ms 376 KB Output is correct
33 Correct 12 ms 376 KB Output is correct
34 Correct 13 ms 372 KB Output is correct
35 Correct 12 ms 376 KB Output is correct
36 Correct 16 ms 504 KB Output is correct
37 Correct 61 ms 612 KB Output is correct
38 Correct 136 ms 684 KB Output is correct
39 Correct 238 ms 968 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 525 ms 760 KB Output is correct
2 Correct 731 ms 760 KB Output is correct
3 Correct 575 ms 632 KB Output is correct
4 Correct 899 ms 632 KB Output is correct
5 Correct 733 ms 760 KB Output is correct
6 Correct 608 ms 760 KB Output is correct
7 Correct 370 ms 632 KB Output is correct
8 Correct 417 ms 636 KB Output is correct
9 Correct 424 ms 636 KB Output is correct
10 Correct 378 ms 632 KB Output is correct
11 Correct 491 ms 632 KB Output is correct
12 Execution timed out 3077 ms 1400 KB Time limit exceeded
13 Halted 0 ms 0 KB -