oj.uz

Submission #967878

# Submission time Handle Problem Language Result Execution time Memory
967878 2024-04-23T03:56:09 Z steveonalex Meetings (JOI19_meetings) C++17
100 / 100
 809 ms 1104 KB 
#include <bits/stdc++.h>
#include "meetings.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
 
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b){a = b; return true;}
        return false;
    }
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b){a = b; return true;}
        return false;
    }
template <class T>
    void printArr(T& a, string separator = " ", string finish = "\n", ostream& out = cout){
        for(auto i: a) out << i << separator;
        out << finish;
    }
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 2007;
int n;
int parent[N];
int h[N];

// int Query(int u, int v, int w){
//     cout << "? " << u << " " << v << " " << w << endl;
//     int verdict; cin >> verdict;
//     return verdict;
// }

// void Bridge(int u, int v){
//     cout << u << " " << v << "\n";
// }

void DnC(vector<int> S){
    vector<int> lck(S.size(), -1);
    int x = S[0];
    int idx = 0;
    for(int i = 1; i<S.size(); ++i){
        int y = S[i];

        int lca = Query(0, x, y);
        if (lca == x){
            lck[idx] = x;
            x = y;
            idx = i;
        }
        else lck[i] = lca;
    }

    vector<int> cur_chain;
    map<int, vector<int>> mp;
    for(int i = 0; i<S.size(); ++i){
        if (lck[i] == S[i] || lck[i] == -1) cur_chain.push_back(S[i]);
        else mp[lck[i]].push_back(S[i]);
    }

    sort(ALL(cur_chain), [](int x, int y){return Query(0, x, y) == x;});
    for(int i = 1; i<cur_chain.size(); ++i) parent[cur_chain[i]] = cur_chain[i-1];

    for(pair<int, vector<int>> i: mp){
        DnC(i.second);
        for(int j: i.second) if (parent[j] == -1) parent[j] = i.first;
    }
}

void Solve(int _n){
    n = _n;
    memset(parent, -1, sizeof parent);

    vector<int> perm;
    for(int i= 1; i<n; ++i) perm.push_back(i);
    shuffle(ALL(perm), rng);

    DnC(perm);
    for(int i = 1; i<n; ++i) if (parent[i] == -1) parent[i] = 0;

    for(int i = 1; i<n; ++i){
        int u = parent[i], v = i;
        if (u > v) swap(u, v);
        Bridge(u, v);
    }
}

// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     Solve(6);

//     return 0;
// }

Compilation message

meetings.cpp: In function 'void DnC(std::vector<int>)':
meetings.cpp:66:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for(int i = 1; i<S.size(); ++i){
      |                    ~^~~~~~~~~
meetings.cpp:80:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |     for(int i = 0; i<S.size(); ++i){
      |                    ~^~~~~~~~~
meetings.cpp:86:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |     for(int i = 1; i<cur_chain.size(); ++i) parent[cur_chain[i]] = cur_chain[i-1];
      |                    ~^~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 219 ms 724 KB Output is correct
2 Correct 246 ms 716 KB Output is correct
3 Correct 237 ms 676 KB Output is correct
4 Correct 266 ms 948 KB Output is correct
5 Correct 176 ms 684 KB Output is correct
6 Correct 210 ms 740 KB Output is correct
7 Correct 373 ms 772 KB Output is correct
8 Correct 473 ms 892 KB Output is correct
9 Correct 459 ms 848 KB Output is correct
10 Correct 473 ms 844 KB Output is correct
11 Correct 469 ms 796 KB Output is correct
12 Correct 313 ms 820 KB Output is correct
13 Correct 130 ms 732 KB Output is correct
14 Correct 361 ms 600 KB Output is correct
15 Correct 233 ms 600 KB Output is correct
16 Correct 307 ms 724 KB Output is correct
17 Correct 487 ms 1104 KB Output is correct
18 Correct 255 ms 600 KB Output is correct
19 Correct 228 ms 716 KB Output is correct
20 Correct 280 ms 728 KB Output is correct
21 Correct 277 ms 600 KB Output is correct
22 Correct 256 ms 1104 KB Output is correct
23 Correct 265 ms 720 KB Output is correct
24 Correct 267 ms 752 KB Output is correct
25 Correct 234 ms 696 KB Output is correct
26 Correct 255 ms 700 KB Output is correct
27 Correct 294 ms 948 KB Output is correct
28 Correct 487 ms 828 KB Output is correct
29 Correct 472 ms 848 KB Output is correct
30 Correct 493 ms 948 KB Output is correct
31 Correct 505 ms 792 KB Output is correct
32 Correct 809 ms 796 KB Output is correct
33 Correct 692 ms 792 KB Output is correct
34 Correct 4 ms 344 KB Output is correct
35 Correct 4 ms 544 KB Output is correct
36 Correct 4 ms 344 KB Output is correct
37 Correct 4 ms 344 KB Output is correct
38 Correct 3 ms 344 KB Output is correct
39 Correct 4 ms 344 KB Output is correct
40 Correct 7 ms 548 KB Output is correct
41 Correct 9 ms 552 KB Output is correct
42 Correct 8 ms 344 KB Output is correct
43 Correct 3 ms 344 KB Output is correct
44 Correct 10 ms 344 KB Output is correct
45 Correct 10 ms 544 KB Output is correct
46 Correct 11 ms 344 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 0 ms 344 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 0 ms 344 KB Output is correct
52 Correct 0 ms 344 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 0 ms 344 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 1 ms 484 KB Output is correct
59 Correct 1 ms 596 KB Output is correct
60 Correct 0 ms 344 KB Output is correct
61 Correct 0 ms 344 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 0 ms 344 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 1 ms 344 KB Output is correct
67 Correct 0 ms 344 KB Output is correct
68 Correct 0 ms 344 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 1 ms 596 KB Output is correct
72 Correct 0 ms 344 KB Output is correct