제출 #1303764

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1303764		opeleklanos	Stations (IOI20_stations)	C++20	0 / 100	3 ms	432 KiB

stations

#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include "stations.h"
using namespace std;


vector<int> label (int n, int k, vector<int> u, vector<int> v){
    vector<int> lb(n, 0);
    for(int i = 0; i<n-1; i++) lb[i] = i;
    return lb;
}

int dfs(int target, int start){
    if( start == target) return 1;
    if(start > target) return 0;
    return (dfs(target, (start*2)+1) || dfs(target, (start*2)+2));
}


int find_next_station(int s, int t, vector<int> c){
    int c1 = s*2+1;
    int c2 = s*2+2;
    if(dfs(t, c2)) return c2;
    if(dfs(t, c1)) return c1;
    return ((s-1)/2);
}


// int main(void){
//     freopen("input.txt", "r", stdin);
//     int n; cin>>n;
//     vector<int> u(n-1, 0);
//     vector<int> v(n-1, 0);
//     for(int i = 0; i<n-1; i++) cin>>u[i]>>v[i];
//     label(n, 100000000, u, v);
//     cout<<find_next_station(0, 6, {})<<endl<<find_next_station(1, 9, {}) << endl<<find_next_station(1, 3, {});
    
// }

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