oj.uz

Submission #170183

# Submission time Handle Problem Language Result Execution time Memory
170183 2019-12-24T07:44:55 Z gs18103 Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1016 KB 
#include "meetings.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define em emplace
#define all(v) v.begin(), v.end()

using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const int MAX = 2020;
const int INF = (1 << 30) - 1;
const ll LINF = 1LL << 60;

int p[MAX];
vector <int> c[MAX];

void add(int a, int b) {
    bool flag = false;
    for(int i = 0; i < c[a].size(); i++) {
        int mid = Query(a, c[a][i], b);
        if(mid == a) continue;
        flag = true;
        if(mid == c[a][i]) {
            add(c[a][i], b);
            break;
        }
        else if(mid == b) {
            p[b] = a;
            p[c[a][i]] = b;
            c[b].eb(c[a][i]);
            c[a][i] = b;
            return;
        }
        else {
            p[c[a][i]] = mid;
            p[b] = mid;
            p[mid] = a;
            c[mid].eb(c[a][i]);
            c[mid].eb(b);
            c[a][i] = mid;
            return;
        }
    }
    if(!flag) {
        p[b] = a, c[a].eb(b);
        return;
    }
}

void Solve(int n) {
    for(int i = 1; i < n; i++) p[i] = -1;
    for(int i = 1; i < n; i++) {
        if(p[i] == -1) add(0, i);
    }
    for(int i = 1; i < n; i++) {
        Bridge(min(i, p[i]), max(i, p[i]));
    }
}

Compilation message

meetings.cpp: In function 'void add(int, int)':
meetings.cpp:23:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < c[a].size(); i++) {
                    ~~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 404 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 2 ms 532 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 504 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 380 KB Output is correct
25 Correct 2 ms 504 KB Output is correct
26 Correct 3 ms 504 KB Output is correct
27 Correct 10 ms 504 KB Output is correct
28 Correct 9 ms 504 KB Output is correct
29 Correct 10 ms 376 KB Output is correct
30 Correct 10 ms 376 KB Output is correct
31 Correct 8 ms 504 KB Output is correct
32 Correct 9 ms 376 KB Output is correct
33 Correct 14 ms 424 KB Output is correct
34 Correct 18 ms 376 KB Output is correct
35 Correct 16 ms 376 KB Output is correct
36 Correct 11 ms 376 KB Output is correct
37 Correct 49 ms 528 KB Output is correct
38 Correct 65 ms 504 KB Output is correct
39 Correct 164 ms 524 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1154 ms 704 KB Output is correct
2 Correct 1330 ms 776 KB Output is correct
3 Correct 1321 ms 844 KB Output is correct
4 Correct 1444 ms 772 KB Output is correct
5 Correct 800 ms 760 KB Output is correct
6 Correct 712 ms 680 KB Output is correct
7 Correct 778 ms 712 KB Output is correct
8 Correct 835 ms 632 KB Output is correct
9 Correct 931 ms 728 KB Output is correct
10 Correct 895 ms 596 KB Output is correct
11 Correct 958 ms 632 KB Output is correct
12 Execution timed out 3022 ms 1016 KB Time limit exceeded
13 Halted 0 ms 0 KB -