oj.uz

Submission #412043

# Submission time Handle Problem Language Result Execution time Memory
412043 2021-05-26T12:37:06 Z AKaan37 Stations (IOI20_stations) C++17
0 / 100
 1079 ms 644 KB 
#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;

int sayac=0,mx;
vector<int> vec[li],vv;
int dp[li];

inline void dfs1(int node,int ata,int der){
	mx=max(mx,der);
	for(auto go:vec[node]){
		if(go==ata)continue;
		dfs1(go,node,der+1);
	}
}

inline void dfs(int node,int ata){
	vv[node]=sayac++;
	int flagg=0;
	//~ vv[node]+=(1<<node);
	for(auto go:vec[node]){
		if(go==ata)continue;
		flagg=1;
		dfs(go,node);
		//~ vv[node]+=vv[go];
	}
	if(flagg==0)sayac+=999;
}

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++)vec[i].clear();
	for(int i=0;i<n-1;i++){
		vec[u[i]].pb(vvv[i]);
		vec[vvv[i]].pb(u[i]);
	}
	vv.clear();
	int ind=-1;
	for(int i=0;i<n;i++){
		vv.pb(0);
		if((int)vec[i].size()>2)ind=i;
	}
	if(ind==-1){
		for(int i=0;i<n;i++){
			if((int)vec[i].size()==1)ind=i;
		}
	}
	//~ cout<<ind
	dfs1(ind,-1,0);
	//~ mx=max(mx,1000-1);
	dfs(ind,-1);
	for (int i = 0; i < n; i++) {
		//~ cout<<vv[i]<<" ** "<<endl;
		labels[i] = vv[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) {
	//~ for(int i=0;i<(int)c.size()-1;i++){
		//~ if((c[i]&t)==t)return c[i];
	//~ }
	//~ return c[(int)c.size()-1];
	if(t==0)return c[0];
	if((int)c.size()==1)return c[0];
	if(t<s)return c[0];
	if(abs(t-s)>=999 && (int)c.size()==2)return c[0];
	if((int)c.size()==2)return c[1];
	int siz=(int)c.size();
	for(int i=0;i<siz-1;i++){
		if(c[i+1]>t)return c[i];
	}
	return c[siz-1];
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 328 KB Invalid labels (values out of range). scenario=1, k=1000, vertex=0, label=1011
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 316 KB Invalid labels (values out of range). scenario=0, k=1000, vertex=4, label=128137
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 730 ms 600 KB Output is correct
2 Correct 618 ms 508 KB Output is correct
3 Correct 926 ms 400 KB Output is correct
4 Correct 789 ms 528 KB Output is correct
5 Correct 688 ms 400 KB Output is correct
6 Correct 604 ms 528 KB Output is correct
7 Correct 518 ms 516 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 6 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 718 ms 556 KB Output is correct
12 Correct 505 ms 532 KB Output is correct
13 Incorrect 5 ms 476 KB Invalid labels (values out of range). scenario=1, k=1000000, vertex=7, label=1166801
14 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1079 ms 644 KB Output is correct
2 Correct 725 ms 472 KB Output is correct
3 Correct 779 ms 400 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 5 ms 444 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 811 ms 500 KB Output is correct
8 Correct 1069 ms 400 KB Output is correct
9 Correct 692 ms 412 KB Output is correct
10 Correct 813 ms 516 KB Output is correct
11 Incorrect 8 ms 420 KB Wrong query response.
12 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# Verdict Execution time Memory Grader output
1 Partially correct 803 ms 528 KB Partially correct
2 Partially correct 543 ms 520 KB Partially correct
3 Partially correct 1045 ms 400 KB Partially correct
4 Partially correct 877 ms 400 KB Partially correct
5 Partially correct 731 ms 528 KB Partially correct
6 Partially correct 451 ms 576 KB Partially correct
7 Correct 465 ms 528 KB Output is correct
8 Partially correct 3 ms 476 KB Partially correct
9 Partially correct 4 ms 612 KB Partially correct
10 Partially correct 2 ms 476 KB Partially correct
11 Incorrect 585 ms 528 KB Wrong query response.
12 Halted 0 ms 0 KB -