oj.uz

Submission #623050

# Submission time Handle Problem Language Result Execution time Memory
623050 2022-08-05T06:37:01 Z radal Meetings (JOI19_meetings) C++17
100 / 100
 993 ms 95780 KB 
#include <bits/stdc++.h>
#include "meetings.h"
#pragma GCC target("sse,sse2,avx2")
#pragma GCC optimize("unroll-loops,O2")
#define rep(i,l,r) for (int i = l; i < r; i++)
#define repr(i,r,l) for (int i = r; i >= l; i--)
#define X first
#define Y second
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define endl '\n'
#define debug(x) cerr << #x << " : " << x << endl;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pll;
constexpr int N = 2e3+10,mod = 998244353,inf = 1e9+10,sq = 700;
inline int mkay(int a,int b){
    if (a+b >= mod) return a+b-mod;
    if (a+b < 0) return a+b+mod;
    return a+b;
}
 
inline int poww(int a,int k){
    if (k < 0) return 0;
    int z = 1;
    while (k){
        if (k&1) z = 1ll*z*a%mod;
        a = 1ll*a*a%mod;
        k /= 2;
    } 
    return z; 
}
int noob;
vector<int> tmp[N][N];
bool cmp(int u,int v){
    int x = Query(u,v,noob);
    if (x == u) return 1;
    return 0;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void dojob(vector<int> ve,int dep = 0){
    int n = ve.size();
    if (n == 1) return;
    if (n == 2){
        if (ve[1] < ve[0]) swap(ve[0],ve[1]);
        Bridge(ve[0],ve[1]);
        return;
    }
    int ind  = rng()%(n-1),ind2 = rng()%(n-ind-1)+ind+1;
    int u = ve[ind],v = ve[ind2];
    vector<int> path;
    tmp[u][dep].pb(u);
    tmp[v][dep].pb(v);
    rep(i,0,n){
        if (i == ind || i == ind2) continue;
        int w = ve[i];
        int x = Query(u,v,w);
        if (x == w) path.pb(w);
        tmp[x][dep].pb(w);
    }
    for (int w : ve) if (!tmp[w][dep].empty()){
        dojob(tmp[w][dep],dep+1);
        tmp[w][dep].clear();
    }
    if (path.empty()){
        Bridge(min(u,v),max(u,v));
        return;
    }
    noob = u;
    sort(all(path),cmp);
    int sz = path.size();
    Bridge(min(u,path[0]),max(u,path[0]));
    Bridge(min(v,path.back()),max(v,path.back()));
    rep(i,1,sz){
        int x = path[i],y = path[i-1];
        if (x > y) swap(x,y);
        Bridge(x,y);
    }

}
void Solve(int n){
    vector<int> ve;
    rep(i,0,n) ve.pb(i);
    dojob(ve);
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 95184 KB Output is correct
2 Correct 52 ms 95184 KB Output is correct
3 Correct 48 ms 95256 KB Output is correct
4 Correct 47 ms 95160 KB Output is correct
5 Correct 47 ms 95176 KB Output is correct
6 Correct 60 ms 95192 KB Output is correct
7 Correct 61 ms 95184 KB Output is correct
8 Correct 49 ms 95156 KB Output is correct
9 Correct 47 ms 95184 KB Output is correct
10 Correct 45 ms 95188 KB Output is correct
11 Correct 46 ms 95176 KB Output is correct
12 Correct 47 ms 95104 KB Output is correct
13 Correct 46 ms 95140 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 95184 KB Output is correct
2 Correct 52 ms 95184 KB Output is correct
3 Correct 48 ms 95256 KB Output is correct
4 Correct 47 ms 95160 KB Output is correct
5 Correct 47 ms 95176 KB Output is correct
6 Correct 60 ms 95192 KB Output is correct
7 Correct 61 ms 95184 KB Output is correct
8 Correct 49 ms 95156 KB Output is correct
9 Correct 47 ms 95184 KB Output is correct
10 Correct 45 ms 95188 KB Output is correct
11 Correct 46 ms 95176 KB Output is correct
12 Correct 47 ms 95104 KB Output is correct
13 Correct 46 ms 95140 KB Output is correct
14 Correct 55 ms 95116 KB Output is correct
15 Correct 47 ms 95236 KB Output is correct
16 Correct 47 ms 95184 KB Output is correct
17 Correct 47 ms 95148 KB Output is correct
18 Correct 48 ms 95164 KB Output is correct
19 Correct 47 ms 95216 KB Output is correct
20 Correct 50 ms 95212 KB Output is correct
21 Correct 49 ms 95140 KB Output is correct
22 Correct 48 ms 95176 KB Output is correct
23 Correct 47 ms 95216 KB Output is correct
24 Correct 48 ms 95136 KB Output is correct
25 Correct 47 ms 95168 KB Output is correct
26 Correct 48 ms 95156 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 95184 KB Output is correct
2 Correct 52 ms 95184 KB Output is correct
3 Correct 48 ms 95256 KB Output is correct
4 Correct 47 ms 95160 KB Output is correct
5 Correct 47 ms 95176 KB Output is correct
6 Correct 60 ms 95192 KB Output is correct
7 Correct 61 ms 95184 KB Output is correct
8 Correct 49 ms 95156 KB Output is correct
9 Correct 47 ms 95184 KB Output is correct
10 Correct 45 ms 95188 KB Output is correct
11 Correct 46 ms 95176 KB Output is correct
12 Correct 47 ms 95104 KB Output is correct
13 Correct 46 ms 95140 KB Output is correct
14 Correct 55 ms 95116 KB Output is correct
15 Correct 47 ms 95236 KB Output is correct
16 Correct 47 ms 95184 KB Output is correct
17 Correct 47 ms 95148 KB Output is correct
18 Correct 48 ms 95164 KB Output is correct
19 Correct 47 ms 95216 KB Output is correct
20 Correct 50 ms 95212 KB Output is correct
21 Correct 49 ms 95140 KB Output is correct
22 Correct 48 ms 95176 KB Output is correct
23 Correct 47 ms 95216 KB Output is correct
24 Correct 48 ms 95136 KB Output is correct
25 Correct 47 ms 95168 KB Output is correct
26 Correct 48 ms 95156 KB Output is correct
27 Correct 53 ms 95304 KB Output is correct
28 Correct 54 ms 95356 KB Output is correct
29 Correct 66 ms 95228 KB Output is correct
30 Correct 49 ms 95268 KB Output is correct
31 Correct 50 ms 95244 KB Output is correct
32 Correct 51 ms 95172 KB Output is correct
33 Correct 55 ms 95200 KB Output is correct
34 Correct 53 ms 95248 KB Output is correct
35 Correct 53 ms 95212 KB Output is correct
36 Correct 53 ms 95268 KB Output is correct
37 Correct 57 ms 95280 KB Output is correct
38 Correct 55 ms 95172 KB Output is correct
39 Correct 56 ms 95264 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 449 ms 95532 KB Output is correct
2 Correct 387 ms 95500 KB Output is correct
3 Correct 391 ms 95584 KB Output is correct
4 Correct 374 ms 95780 KB Output is correct
5 Correct 308 ms 95520 KB Output is correct
6 Correct 302 ms 95544 KB Output is correct
7 Correct 371 ms 95584 KB Output is correct
8 Correct 401 ms 95632 KB Output is correct
9 Correct 462 ms 95736 KB Output is correct
10 Correct 402 ms 95692 KB Output is correct
11 Correct 391 ms 95668 KB Output is correct
12 Correct 460 ms 95688 KB Output is correct
13 Correct 359 ms 95584 KB Output is correct
14 Correct 260 ms 95556 KB Output is correct
15 Correct 292 ms 95556 KB Output is correct
16 Correct 329 ms 95676 KB Output is correct
17 Correct 483 ms 95676 KB Output is correct
18 Correct 426 ms 95636 KB Output is correct
19 Correct 358 ms 95648 KB Output is correct
20 Correct 429 ms 95592 KB Output is correct
21 Correct 418 ms 95604 KB Output is correct
22 Correct 323 ms 95688 KB Output is correct
23 Correct 359 ms 95536 KB Output is correct
24 Correct 345 ms 95692 KB Output is correct
25 Correct 415 ms 95752 KB Output is correct
26 Correct 350 ms 95648 KB Output is correct
27 Correct 395 ms 95552 KB Output is correct
28 Correct 450 ms 95664 KB Output is correct
29 Correct 365 ms 95664 KB Output is correct
30 Correct 402 ms 95588 KB Output is correct
31 Correct 428 ms 95724 KB Output is correct
32 Correct 993 ms 95624 KB Output is correct
33 Correct 787 ms 95624 KB Output is correct
34 Correct 51 ms 95252 KB Output is correct
35 Correct 62 ms 95212 KB Output is correct
36 Correct 52 ms 95272 KB Output is correct
37 Correct 49 ms 95176 KB Output is correct
38 Correct 47 ms 95240 KB Output is correct
39 Correct 52 ms 95164 KB Output is correct
40 Correct 57 ms 95268 KB Output is correct
41 Correct 53 ms 95180 KB Output is correct
42 Correct 56 ms 95176 KB Output is correct
43 Correct 53 ms 95176 KB Output is correct
44 Correct 61 ms 95260 KB Output is correct
45 Correct 54 ms 95284 KB Output is correct
46 Correct 57 ms 95208 KB Output is correct
47 Correct 49 ms 95152 KB Output is correct
48 Correct 49 ms 95120 KB Output is correct
49 Correct 46 ms 95196 KB Output is correct
50 Correct 49 ms 95188 KB Output is correct
51 Correct 56 ms 95220 KB Output is correct
52 Correct 52 ms 95120 KB Output is correct
53 Correct 56 ms 95220 KB Output is correct
54 Correct 54 ms 95144 KB Output is correct
55 Correct 52 ms 95184 KB Output is correct
56 Correct 57 ms 95160 KB Output is correct
57 Correct 53 ms 95192 KB Output is correct
58 Correct 57 ms 95176 KB Output is correct
59 Correct 64 ms 95132 KB Output is correct
60 Correct 57 ms 95144 KB Output is correct
61 Correct 61 ms 95228 KB Output is correct
62 Correct 50 ms 95216 KB Output is correct
63 Correct 50 ms 95176 KB Output is correct
64 Correct 61 ms 95112 KB Output is correct
65 Correct 56 ms 95092 KB Output is correct
66 Correct 53 ms 95128 KB Output is correct
67 Correct 57 ms 95152 KB Output is correct
68 Correct 48 ms 95184 KB Output is correct
69 Correct 48 ms 95148 KB Output is correct
70 Correct 52 ms 95216 KB Output is correct
71 Correct 60 ms 95192 KB Output is correct
72 Correct 52 ms 95192 KB Output is correct