Submission #411740

#	Time	Username	Problem	Language	Result	Execution time	Memory
411740		AKaan37	Stations (IOI20_stations)	C++17	8 / 100	1053 ms	556 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long lo; 
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 1005;
const lo mod = 1000000007;

vector<int> vec[li],vv;
int dp[li];

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> vvv) {
	std::vector<int> labels(n);
	for (int i = 0; i < n; i++) {
		//~ cout<<vv[i]<<endl;
		labels[i] = i;
	}
	return labels;
}

inline int f(int sira,int hedef){
	int cevv=0;
	if(sira>hedef)return 0;
	if(sira==hedef)return 1;
	if(~dp[sira])return dp[sira];
	cevv=max(cevv,f(sira*2+1,hedef));
	cevv=max(cevv,f(sira*2+2,hedef));
	return dp[sira]=cevv;
}

int find_next_station(int s, int t, std::vector<int> c) {
	//~ memset(dp,-1,sizeof(dp));
	//~ cout<<s<<" :: "<<t<<" :: "<<c[0]<<" :: "<<c[1]<<endl;
	if((int)c.size()==1)return c[0];
	if((int)c.size()==2){
		while(t>c[0] && t>c[1]){
			if(t%2)t--;
			else t-=2;
			t/=2;
		}
		if(t!=c[0] && t!=c[1])t=c[0];
		return t;
	}
	while(t>c[1] && t>c[2]){
		if(t%2)t--;
		else t-=2;
		t/=2;
	}
	if(t!=c[1] && t!=c[2])t=c[0];
	return t;
	return c[0];
}

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