제출 #1057016

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1057016		c2zi6	기지국 (IOI20_stations)	C++14	76 / 100	531 ms	1196 KiB

stations

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "stations.h"

VVI gp;

VI tin, tout;
int tc;
VI depth;

void dfs(int u, int p = -1) {
    tin[u] = tc++;
    for (int v : gp[u]) if (v != p) {
        depth[v] = depth[u]+1;
        dfs(v, u);
    }
    tout[u] = tc++;
}

VI label(int n, int k, VI U, VI V) {
    gp = VVI(n);
    rep(i, n-1) {
        int u = U[i];
        int v = V[i];
        gp[u].pb(v);
        gp[v].pb(u);
    }
    tc = 0;
    tin = tout = depth = VI(n);
    dfs(0);

    VI ret(n);
    rep(i, n) {
        if (depth[i]&1) ret[i] = tin[i];
        else ret[i] = tout[i];
    }

    /*rep(i, n) cout << i << ": " << tin[i] << ".." << tout[i] << endl;*/
    /*for (int x : ret) cout << x << " "; cout << endl;*/
    return ret;
}

bool isanc(int a, int b) {
    return a/1000 <= b/1000 && b%1000 <= a%1000;
}

int find_next_station(int s, int t, VI c) {
    if (c.size() == 1) return c[0];
    int n = c.size();
    int parent;
    int mytin, mytout;
    
    /*cout << "ME: " << s << endl;*/
    /*cout << "THEY: ";*/
    /*for (int x : c) cout << x << " ";*/
    /*cout << endl;*/

    bool they = (s < c[0]);
    /*
     * true - bolor@ tout en, es tin em
     * false - bolor@ tin en, es tout em
     */
    if (s == 0) {
        mytin = 0;
        parent = -1;
    } else if (they) {
        mytin = s;
        mytout = c[n-2]+1;
        parent = c.back();
    } else {
        mytin = c[1]-1;
        mytout = s;
        parent = c[0];
    }

    /*cout << mytin << ".." << mytout << endl;*/
    if (t < mytin || t > mytout) return parent;
    if (they) {
        for (int x : c) if (x != parent) {
            if (x >= t) return x;
        }
    } else {
        reverse(all(c));
        for (int x : c) if (x != parent) {
            if (x <= t) return x;
        }
    }
    return parent;

}

컴파일 시 표준 에러 (stderr) 메시지

stations.cpp: In function 'int find_next_station(int, int, VI)':
stations.cpp:106:24: warning: 'mytout' may be used uninitialized in this function [-Wmaybe-uninitialized]
  106 |     if (t < mytin || t > mytout) return parent;
      |                      ~~^~~~~~~~

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