oj.uz

Submission #611650

# Submission time Handle Problem Language Result Execution time Memory
611650 2022-07-29T06:17:22 Z alireza_kaviani Meetings (JOI19_meetings) C++17
100 / 100
 940 ms 848 KB 
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;

#define all(x)  (x).begin(), (x).end()
#define SZ(x)   int((x).size())

const int MAXN = 2010;

int n , cur , sz[MAXN] , mx[MAXN] , par[MAXN] , mark[MAXN];
vector<int> adj[MAXN];

int cmp(int x , int y){
    return sz[x] > sz[y];
}

int LCA(int v , int u){
    return Query(0 , v , u);
}

void PreDFS(int v){
    sz[v] = 1; mx[v] = v;
    for(int u : adj[v]){
        PreDFS(u);
        par[u] = v;
        sz[v] += sz[u];
    }
    sort(all(adj[v]) , cmp);
    if(SZ(adj[v]) > 0){
        mx[v] = mx[adj[v][0]];
    }
}

void Insert(int v , int u , int x){
    vector<int> vec;
    while(v != u){
        vec.push_back(v);
        v = par[v];
    }
    vec.push_back(u);
    int l = 0 , r = SZ(vec) - 1;
    while(r - l > 1){
        int mid = l + r >> 1;
        if(LCA(x , vec[mid]) == vec[mid])   r = mid;
        else    l = mid;
    }
    v = vec[r]; u = vec[l];
    adj[v].erase(find(all(adj[v]) , u));
    adj[v].push_back(x);
    adj[x].push_back(u);
    mark[x] = 1;
}

int Solve(int v , int ptr){
    for(int i = ptr ; i < SZ(adj[v]) ; i++){
        int u = adj[v][i];
        int lca = LCA(cur , mx[u]);
        if(lca == v){
            continue;
        }
        if(mark[lca]){
            return Solve(lca , 1);
        }
        Insert(mx[u] , v , lca);
        return lca;
    }
    return v;
}

void Solve(int N) {
    n = N;
    mark[0] = 1;
    for(int i = 1 ; i < n ; i++){
        if(mark[i]) continue;
        PreDFS(0);
        cur = i;
        int p = Solve(0 , 0);
        if(p == i)  continue;
        adj[p].push_back(i);
        mark[i] = 1;
    }
    for(int i = 0 ; i < n ; i++){
        for(int j : adj[i]){
            Bridge(min(i , j) , max(i , j));
        }
    }
}

Compilation message

meetings.cpp: In function 'void Insert(int, int, int)':
meetings.cpp:43:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   43 |         int mid = l + r >> 1;
      |                   ~~^~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 4 ms 336 KB Output is correct
28 Correct 4 ms 336 KB Output is correct
29 Correct 6 ms 436 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 4 ms 336 KB Output is correct
32 Correct 12 ms 336 KB Output is correct
33 Correct 12 ms 436 KB Output is correct
34 Correct 15 ms 440 KB Output is correct
35 Correct 12 ms 464 KB Output is correct
36 Correct 4 ms 336 KB Output is correct
37 Correct 17 ms 460 KB Output is correct
38 Correct 11 ms 584 KB Output is correct
39 Correct 2 ms 464 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 367 ms 588 KB Output is correct
2 Correct 375 ms 700 KB Output is correct
3 Correct 392 ms 592 KB Output is correct
4 Correct 349 ms 592 KB Output is correct
5 Correct 287 ms 596 KB Output is correct
6 Correct 307 ms 584 KB Output is correct
7 Correct 687 ms 596 KB Output is correct
8 Correct 747 ms 592 KB Output is correct
9 Correct 903 ms 596 KB Output is correct
10 Correct 853 ms 588 KB Output is correct
11 Correct 786 ms 600 KB Output is correct
12 Correct 401 ms 640 KB Output is correct
13 Correct 254 ms 620 KB Output is correct
14 Correct 459 ms 612 KB Output is correct
15 Correct 451 ms 608 KB Output is correct
16 Correct 437 ms 612 KB Output is correct
17 Correct 708 ms 580 KB Output is correct
18 Correct 348 ms 600 KB Output is correct
19 Correct 340 ms 588 KB Output is correct
20 Correct 489 ms 592 KB Output is correct
21 Correct 441 ms 600 KB Output is correct
22 Correct 471 ms 604 KB Output is correct
23 Correct 451 ms 608 KB Output is correct
24 Correct 508 ms 608 KB Output is correct
25 Correct 502 ms 576 KB Output is correct
26 Correct 442 ms 604 KB Output is correct
27 Correct 431 ms 712 KB Output is correct
28 Correct 681 ms 592 KB Output is correct
29 Correct 637 ms 596 KB Output is correct
30 Correct 726 ms 592 KB Output is correct
31 Correct 649 ms 592 KB Output is correct
32 Correct 940 ms 812 KB Output is correct
33 Correct 116 ms 848 KB Output is correct
34 Correct 4 ms 336 KB Output is correct
35 Correct 4 ms 336 KB Output is correct
36 Correct 4 ms 336 KB Output is correct
37 Correct 4 ms 336 KB Output is correct
38 Correct 3 ms 464 KB Output is correct
39 Correct 6 ms 336 KB Output is correct
40 Correct 10 ms 336 KB Output is correct
41 Correct 15 ms 336 KB Output is correct
42 Correct 12 ms 440 KB Output is correct
43 Correct 3 ms 336 KB Output is correct
44 Correct 14 ms 456 KB Output is correct
45 Correct 14 ms 456 KB Output is correct
46 Correct 3 ms 464 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 1 ms 336 KB Output is correct
49 Correct 1 ms 336 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 0 ms 336 KB Output is correct
52 Correct 1 ms 336 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Correct 1 ms 336 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 1 ms 336 KB Output is correct
57 Correct 1 ms 336 KB Output is correct
58 Correct 1 ms 336 KB Output is correct
59 Correct 1 ms 336 KB Output is correct
60 Correct 0 ms 336 KB Output is correct
61 Correct 1 ms 336 KB Output is correct
62 Correct 0 ms 336 KB Output is correct
63 Correct 1 ms 336 KB Output is correct
64 Correct 0 ms 336 KB Output is correct
65 Correct 1 ms 336 KB Output is correct
66 Correct 0 ms 336 KB Output is correct
67 Correct 0 ms 336 KB Output is correct
68 Correct 0 ms 336 KB Output is correct
69 Correct 1 ms 336 KB Output is correct
70 Correct 0 ms 336 KB Output is correct
71 Correct 0 ms 336 KB Output is correct
72 Correct 1 ms 336 KB Output is correct