oj.uz

Submission #702459

# Submission time Handle Problem Language Result Execution time Memory
702459 2023-02-24T06:25:09 Z PixelCat Meetings (JOI19_meetings) C++14
29 / 100
 1924 ms 1292 KB 
#include "meetings.h"

#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
#define int LL
using namespace std;
using LL = long long;
using pii = pair<int, int>;

const int MAXN = 2010;

// struct DSU {
//     int p[MAXN];
//     void init() {
//         memset(p, -1, sizeof(p));
//     }
//     int find(int n) {
//         if(p[n] < 0) return n;
//         return p[n] = find(p[n]);
//     }
//     void uni(int a, int b) {
//         a = find(a); b = find(b);
//         if(a != b) p[b] = a;
//     }
// } dsu;

mt19937_64 rng(48763);
vector<pii> edges;

int m_qry(int a, int b, int c) {
    if(a == b) return a;
    if(a == c) return a;
    if(b == c) return b;
    return Query(a, b, c);
}

void solve(vector<int> &ids) {
    if(sz(ids) == 1) return;
    if(sz(ids) == 2) {
        edges.eb(ids[0], ids[1]);
        // for(auto &i:ids) cout << i << " ";
        // cout << " - " << ids[0] << " " << ids[1] << "\n" << flush;
        return;
    }

    int rt = rng() % sz(ids);
    int p1 = rng() % sz(ids);
    while(p1 == rt) p1 = rng() % sz(ids);
    rt = ids[rt]; p1 = ids[p1];
    int p2 = p1;

    vector<int> a(1, p1), b(1, rt);
    for(auto &i:ids) if(i != rt && i != p1) {
        // cout << rt << " " << p2 << " " << i << "\n" << flush;
        auto res = m_qry(rt, p2, i);
        if(res != rt) {
            a.eb(i);
            p2 = res;
        } else {
            b.eb(i);
        }
    }
    // for(auto &i:ids) cout << i << " ";
    // cout << " - " << rt << " " << p2 << "\n" << flush;
    edges.eb(rt, p2);
    solve(a);
    solve(b);
}

void Solve(int32_t n) {
    edges.clear();
    vector<int> ids(n);
    For(i, 0, n - 1) ids[i] = i;
    solve(ids);
    for(auto &p:edges) {
        if(p.F > p.S) swap(p.F, p.S);
        Bridge(p.F, p.S);
    }
}
//   int x = Query(0, 1, 2);
//   for (int u = 0; u < N - 1; ++u) {
//     Bridge(u, u + 1);
//   }

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 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 348 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 1 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 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 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 348 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 1 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 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 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 348 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 1 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 16 ms 464 KB Output is correct
28 Correct 17 ms 464 KB Output is correct
29 Correct 20 ms 500 KB Output is correct
30 Correct 13 ms 440 KB Output is correct
31 Correct 16 ms 464 KB Output is correct
32 Correct 22 ms 460 KB Output is correct
33 Correct 34 ms 544 KB Output is correct
34 Correct 50 ms 632 KB Output is correct
35 Correct 40 ms 672 KB Output is correct
36 Correct 12 ms 444 KB Output is correct
37 Correct 7 ms 336 KB Output is correct
38 Correct 7 ms 408 KB Output is correct
39 Correct 5 ms 412 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 1924 ms 1292 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -