oj.uz

Submission #635666

# Submission time Handle Problem Language Result Execution time Memory
635666 2022-08-26T15:52:53 Z jhnah917 Through Another Maze Darkly (CCO21_day1problem3) C++14
4 / 25
 100 ms 43960 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int SZ = 1 << 21;

int N, Q, On[808080], R[808080], T[SZ];
vector<int> G[80808];
vector<pair<int,int>> Tour;
vector<int> Idx[808080]; // Idx[t] : t에 켜지는 정점

void Add(int x, int v){ for(x+=3; x<SZ; x+=x&-x) T[x] += v; }
int Get(int x){ int ret = 0; for(x+=3; x; x-=x&-x) ret += T[x]; return ret; }
int Kth(int x){
    int l = 0, r = Tour.size() - 1;
    while(l < r){
        int m = (l + r) / 2;
        if(Get(m) >= x) r = m;
        else l = m + 1;
    }
    return r;
}

void GetTime(int v, int b=-1, int t=1){
    On[v] = t;
    int pos = find(G[v].begin(), G[v].end(), b) - G[v].begin();
    for(int i=0; i<pos; i++) GetTime(G[v][i], v, t);
    for(int i=pos+1; i<G[v].size(); i++) GetTime(G[v][i], v, t+1);
    if(b != -1) rotate(G[v].begin(), G[v].begin()+pos, G[v].end());
}

inline void AddEdge(int s, int e){
    Idx[max(On[s], On[e])].push_back(Tour.size());
    Tour.emplace_back(s, e);
}

void GetTour(int v, int b=-1){
    for(auto i : G[v]) if(i != b) AddEdge(v, i), GetTour(i, v), AddEdge(i, v);
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    cin >> N >> Q;
    for(int i=1; i<=N; i++){
        int sz; cin >> sz; G[i].resize(sz);
        for(auto &j : G[i]) cin >> j;
        rotate(G[i].begin(), G[i].begin()+1, G[i].end());
    }
    GetTime(1);
    GetTour(1);

    vector<pair<ll,ll>> V(Q);
    for(int i=0; i<Q; i++) cin >> V[i].first, V[i].second = i + 1;
    sort(V.begin(), V.end());

    ll now = 0;
    for(int i=0, j=1; i<V.size(); i++){
        for(; j<=N && now<V[i].first; j++){
            for(auto e : Idx[j]) Add(e, 1);
            now += Get(Tour.size());
        }
        ll k = V[i].first - (now - Get(Tour.size()));
        R[V[i].second] = Kth((k - 1) % (2*N-2) + 1);
    }
    for(int i=1; i<=Q; i++) cout << Tour[R[i]].second << "\n";
}

Compilation message

Main.cpp: In function 'void GetTime(int, int, int)':
Main.cpp:27:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for(int i=pos+1; i<G[v].size(); i++) GetTime(G[v][i], v, t+1);
      |                      ~^~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:56:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     for(int i=0, j=1; i<V.size(); i++){
      |                       ~^~~~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 21204 KB Output is correct
2 Correct 20 ms 23504 KB Output is correct
3 Incorrect 100 ms 43960 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 21332 KB Output is correct
2 Correct 13 ms 21320 KB Output is correct
3 Correct 12 ms 21460 KB Output is correct
4 Correct 12 ms 21460 KB Output is correct
5 Correct 13 ms 21460 KB Output is correct
6 Correct 15 ms 21460 KB Output is correct
7 Correct 13 ms 21472 KB Output is correct
8 Correct 13 ms 21508 KB Output is correct
9 Correct 14 ms 21588 KB Output is correct
10 Correct 16 ms 21588 KB Output is correct
11 Correct 13 ms 21588 KB Output is correct
12 Correct 15 ms 21732 KB Output is correct
13 Correct 13 ms 21716 KB Output is correct
14 Correct 13 ms 21580 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 22360 KB Output is correct
2 Correct 34 ms 26824 KB Output is correct
3 Incorrect 81 ms 34456 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 21204 KB Output is correct
2 Correct 20 ms 23504 KB Output is correct
3 Incorrect 100 ms 43960 KB Output isn't correct
4 Halted 0 ms 0 KB -