oj.uz

Submission #423392

# Submission time Handle Problem Language Result Execution time Memory
423392 2021-06-11T04:59:09 Z Belgutei Stations (IOI20_stations) C++17
0 / 100
 1117 ms 640 KB 
#include "stations.h"

#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mk make_pair

vector<int> edge[1005];
bool visited[1005];

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	/*
	for(int i=0; i<u.size(); i++){
		edge[u[i]].pb(v[i]);
		edge[v[i]].pb(u[i]);
	}
	int pos=0;
	for(int i=0; i<n; i++){
		if(edge[i].size()==1){
			pos=i;
			break;
		}
	}
	int cnt=0;
	
	while(visited[pos]==0){
		cout<<pos<<" ";
		visited[pos]=1;
		labels[pos]=cnt;
		for(int i=0; i<edge[pos].size(); i++){
			if(visited[edge[pos][i]]==0){
				pos=edge[pos][i];
				break;
			}
		}
		cnt++;
	}
	cout<<"\n";
	*/
	std::vector<int> labels(n);
	for(int i=0; i<n; i++){
		labels[i]=i;
	}
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	if(c.size()==1){
		return c[0];
	}
	int mx=max(c[0],c[1]);
	int mn=min(c[0],c[1]);
	if(s>t) return mn;
	else return mx;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 502 ms 584 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 560 ms 640 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 628 ms 532 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1117 ms 400 KB Output is correct
2 Incorrect 789 ms 528 KB Wrong query response.
3 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# Verdict Execution time Memory Grader output
1 Incorrect 568 ms 500 KB Wrong query response.
2 Halted 0 ms 0 KB -