oj.uz

Submission #967876

# Submission time Handle Problem Language Result Execution time Memory
967876 2024-04-23T03:48:30 Z steveonalex Meetings (JOI19_meetings) C++17
0 / 100
 58 ms 852 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];
    for(int i = 1; i<S.size(); ++i){
        int y = S[i];

        int lca = Query(0, x, y);
        if (lca == x){
            lck[x] = x;
            x = y;
        }
        else lck[y] = 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:65:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for(int i = 1; i<S.size(); ++i){
      |                    ~^~~~~~~~~
meetings.cpp:78:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |     for(int i = 0; i<S.size(); ++i){
      |                    ~^~~~~~~~~
meetings.cpp:84:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |     for(int i = 1; i<cur_chain.size(); ++i) parent[cur_chain[i]] = cur_chain[i-1];
      |                    ~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Incorrect 0 ms 344 KB Wrong Answer [4]
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Incorrect 0 ms 344 KB Wrong Answer [4]
5 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Incorrect 0 ms 344 KB Wrong Answer [4]
5 Halted 0 ms 0 KB -

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Runtime error 58 ms 852 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -