oj.uz

Submission #374966

# Submission time Handle Problem Language Result Execution time Memory
374966 2021-03-08T17:13:57 Z BartolM Meetings (JOI19_meetings) C++17
29 / 100
 2000 ms 1052 KB 
#include "meetings.h"
#include <bits/stdc++.h>

using namespace std;

#define X first
#define Y second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;

const int INF=0x3f3f3f3f;
const int N=2005;

int n, uk;
int node[N], komp[N];
vector <int> vec[N];

#define DEBUG 0
void upit(int x, int y) {
    #if DEBUG
        printf("%d <-> %d\n", x, y);
    #endif
    Bridge(min(x, y), max(x, y));
}



void resi(vector <int> &v) {
    int curr=0;
    int koji[18];
    int cent=v[rand()%(int)v.size()];
    #if DEBUG
        printf("cent==%d, resi: ", cent);
        for (int x:v) printf("%d ", x);
        printf("\n");
    #endif // DEBUG

    for (int x:v) {
        if (x==cent) continue;
        int fl=0;
        for (int i=0; i<curr; ++i) {
            int y=Query(node[cent], node[koji[i]], node[x]);
            if (y==node[cent]) continue;
            komp[x]=uk+i;
            fl=1;
            if (y==node[x]) koji[i]=x;
            break;
        }
        if (!fl) {
            komp[x]=curr+uk;
            koji[curr++]=x;
        }
    }
    for (int i=0; i<curr; ++i) upit(node[cent], node[koji[i]]);
    komp[cent]=uk+curr;
    uk+=curr+1;
}

void Solve(int nn) {
    n=nn;
    srand(time(0));
    for (int i=0; i<n; ++i) node[i]=i, komp[i]=0;
    random_shuffle(node, node+n);

    int da=1;
    while (da) {
        da=0;
        uk=0;
        for (int i=0; i<n; ++i) vec[i].clear();
        for (int i=0; i<n; ++i) vec[komp[i]].pb(i);
        for (int i=0; i<n; ++i) {
            if (vec[i].size()>1) {
                resi(vec[i]);
                da=1;
            }
            else if (vec[i].size()) komp[vec[i][0]]=uk++;
        }
    }
}
/*
5
0 1
0 2
1 3
1 4
*/

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 640 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 ms 492 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 640 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 34 ms 516 KB Output is correct
28 Correct 31 ms 492 KB Output is correct
29 Correct 40 ms 492 KB Output is correct
30 Correct 39 ms 492 KB Output is correct
31 Correct 31 ms 492 KB Output is correct
32 Correct 20 ms 492 KB Output is correct
33 Correct 20 ms 492 KB Output is correct
34 Correct 81 ms 748 KB Output is correct
35 Correct 61 ms 492 KB Output is correct
36 Correct 21 ms 492 KB Output is correct
37 Correct 12 ms 492 KB Output is correct
38 Correct 13 ms 492 KB Output is correct
39 Correct 11 ms 492 KB Output is correct

Subtask #4
0 / 71.0

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