Submission #432883

#	Time	Username	Problem	Language	Result	Execution time	Memory
432883		lior5654	기지국 (IOI20_stations)	C++17	0 / 100	870 ms	784 KiB

stations

#include <bits/stdc++.h>

using namespace std;


typedef long long int ll;
typedef pair<ll, ll> pl;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pl> vpl;
typedef vector<vpl> vvpl;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pi> vpi;
typedef vector<vpi> vvpi;

#define rep(i, n) for(int i = 0; i < n; ++i)
#define all(c) (c.begin()), (c.end())
#define pb push_back
#define eb emplace_back
#define fi first
#define se second


#include "stations.h"


const int maxn = 1e3 + 5;

vi g[maxn];


std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
    vi res(n);
    rep(i, n) {
        res[i] = i;
    }
    return res;
}

int find_next_station(int s, int t, std::vector<int> c) {
	if( t < s) {
        return *min_element(all(c));
    }
    while(t) {
        for(auto e : c) {
            if(e == t) return e;
        }
        t = (t - 1) / 2;
    }
    assert(false);

}

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