제출 #312383

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
312383		jainbot27	기지국 (IOI20_stations)	C++17	0 / 100	3070 ms	2097156 KiB

stations

#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()

#define FOR(x, y, z) for(int x = (y); x < (z); x++)
#define ROF(x, z, y) for(int x = (y-1); x >= (z); x--)
#define F0R(x, z) FOR(x, 0, z)
#define R0F(x, z) ROF(x, 0, z)
#define trav(x, y) for(auto&x:y)

using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;

template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const char nl = '\n';
const int mxN = 2e5 + 10;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;


vi res; int tot = 0;
int n, k; vi u, v; vector<vi> adj;
void dfs(int U, int P, int T){
    // cout << U << " " << P << endl;
    if(!T) res[U] = ++tot;
    trav(V, adj[U]){
        if(V == P) continue;
        dfs(V, U, T^1);
    }
    if(T) res[U] = ++tot;
}
vi label(int N, int K, vi U, vi V){
    n = N, k = K, u = U, v = V;
    res.resize(n); adj.resize(n);
    F0R(i, n-1){
        adj[u[i]].pb(v[i]);
        adj[v[i]].pb(u[i]);
    }
    cout << nl;
    dfs(0, -1, 0);
    return res;
}

int find_next_station(int s, int t, vi c){
    trav(x, c)
        if(min(x, s) <= t && max(x, s) >= t)
            return x;
    return c[0];
}

// int main(){
//     int n, k; cin >> n >> k;
//     vi U, V;
//     F0R(i, n-1){
//         int uu, vv; cin >> uu;
//         U.pb(uu);
//     }
//     F0R(i, n-1){
//         int uu, vv; cin >> vv;
//         V.pb(vv);
//     }

//     vi ANS = label(n, k, U, V);
//     F0R(i, n){
//         cout << ANS[i] << "\n";
//     }
// }

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 16
• Subtask 4: 0 / 10
• Subtask 5: 0 / 61