oj.uz

Submission #205224

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

void Solve(int n){
    for(int i = 0; i < n; ++i)
        vectors[0].pb(i);
    if(vectors[0].size() > 1)
        calc(0, vectors[0]);
    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:24:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i < lead.size(); ++i){
                        ~~^~~~~~~~~~~~~
meetings.cpp:43: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 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 380 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 428 KB Output is correct
9 Correct 5 ms 380 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 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 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 380 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 428 KB Output is correct
9 Correct 5 ms 380 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 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 408 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 5 ms 504 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 504 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 504 KB Output is correct
24 Correct 5 ms 504 KB Output is correct
25 Correct 5 ms 504 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 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 380 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 428 KB Output is correct
9 Correct 5 ms 380 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 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 408 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 5 ms 504 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 504 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 504 KB Output is correct
24 Correct 5 ms 504 KB Output is correct
25 Correct 5 ms 504 KB Output is correct
26 Correct 6 ms 376 KB Output is correct
27 Correct 14 ms 504 KB Output is correct
28 Correct 10 ms 504 KB Output is correct
29 Correct 14 ms 504 KB Output is correct
30 Correct 15 ms 504 KB Output is correct
31 Correct 13 ms 504 KB Output is correct
32 Correct 11 ms 376 KB Output is correct
33 Correct 13 ms 376 KB Output is correct
34 Correct 14 ms 376 KB Output is correct
35 Correct 12 ms 376 KB Output is correct
36 Correct 14 ms 448 KB Output is correct
37 Correct 55 ms 632 KB Output is correct
38 Correct 141 ms 632 KB Output is correct
39 Correct 201 ms 684 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 527 ms 784 KB Output is correct
2 Correct 722 ms 888 KB Output is correct
3 Correct 561 ms 920 KB Output is correct
4 Correct 890 ms 980 KB Output is correct
5 Correct 713 ms 760 KB Output is correct
6 Correct 568 ms 760 KB Output is correct
7 Correct 369 ms 760 KB Output is correct
8 Correct 403 ms 760 KB Output is correct
9 Correct 421 ms 888 KB Output is correct
10 Correct 368 ms 888 KB Output is correct
11 Correct 461 ms 1020 KB Output is correct
12 Execution timed out 3066 ms 1516 KB Time limit exceeded
13 Halted 0 ms 0 KB -