답안 #307378

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
307378	2020-09-28T03:35:29 Z	arthur_nascimento	기지국 (IOI20_stations)	C++14	0 / 100	873 ms	1048 KB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define debug
#define maxn 1010
int ini[maxn];
int fim[maxn];
int h[maxn];
vector<int> L[maxn];

int cur = 0;
void dfs(int x){
	debug("dfs %d\n",x);
	ini[x] = cur++;
	for(int i : L[x])
		if(ini[i] == 0 && i > 0){
			h[i] = 1 + h[x];
			dfs(i);
		}
	fim[x] = cur++;
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	cur = 0;
	for(int i=0;i<n;i++)
		L[i].clear(), h[i] = ini[i] = fim[i] = 0;
	for(int i=0;i<n-1;i++){
		L[u[i]].pb(v[i]);
		L[v[i]].pb(u[i]);
	}
	dfs(0);
	vector<int> ret;
	for(int i=0;i<n;i++){
		if(h[i]%2 == 0)
			ret.pb(ini[i]);
		else
			ret.pb(ini[i]);
	}
	for(int i : ret)
		debug("%d ",i);
	debug("\n");
	return ret;
}

int find_next_station(int s, int t, std::vector<int> c) {

	if(t > s) return s+1;
	else return s-1;

	debug("qr %d %d ~",s,t); for(int i : c) debug("%d ",i); debug("\n");
	if(c.size() == 1) return c[0];
	sort(c.begin(), c.end());
	if(s < c[0]){
		// S é entrada, c[i] é saida
		int pai = c[c.size()-1];
		if(t < s) return pai;
		if(c.size() >= 2 && t > c[c.size()-2]) return pai;
		for(int i=0;i<c.size();i++){
			if(t <= c[i])
				return c[i];
		}
		
	}
	else {
		// S é saida, c[i] é entrada
		int pai = c[0];
		if(t > s) return pai;
		if(t < c[1]) return pai;
		for(int i=1;i<c.size()-1;i++){
			if(t < c[i+1]) return c[i];
		}
		return c[c.size()-1];
	}
}

Compilation message

stations.cpp: In function 'void dfs(int)':
stations.cpp:14:8: warning: left operand of comma operator has no effect [-Wunused-value]
   14 |  debug("dfs %d\n",x);
      |        ^~~~~~~~~~
stations.cpp: In function 'std::vector<int> label(int, int, std::vector<int>, std::vector<int>)':
stations.cpp:41:9: warning: left operand of comma operator has no effect [-Wunused-value]
   41 |   debug("%d ",i);
      |         ^~~~~
stations.cpp:42:8: warning: statement has no effect [-Wunused-value]
   42 |  debug("\n");
      |       ~^~~~~
stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:51:8: warning: left operand of comma operator has no effect [-Wunused-value]
   51 |  debug("qr %d %d ~",s,t); for(int i : c) debug("%d ",i); debug("\n");
      |        ^~~~~~~~~~~~
stations.cpp:51:23: warning: right operand of comma operator has no effect [-Wunused-value]
   51 |  debug("qr %d %d ~",s,t); for(int i : c) debug("%d ",i); debug("\n");
      |                       ^
stations.cpp:51:48: warning: left operand of comma operator has no effect [-Wunused-value]
   51 |  debug("qr %d %d ~",s,t); for(int i : c) debug("%d ",i); debug("\n");
      |                                                ^~~~~
stations.cpp:51:64: warning: statement has no effect [-Wunused-value]
   51 |  debug("qr %d %d ~",s,t); for(int i : c) debug("%d ",i); debug("\n");
      |                                                               ~^~~~~
stations.cpp:59:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |   for(int i=0;i<c.size();i++){
      |               ~^~~~~~~~~
stations.cpp:70:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |   for(int i=1;i<c.size()-1;i++){
      |               ~^~~~~~~~~~~

Subtask #1

0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	3 ms	384 KB	Invalid labels (values out of range). scenario=2, k=1000, vertex=5, label=1034
2	Halted	0 ms	0 KB	-

Subtask #2

0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	4 ms	384 KB	Invalid labels (values out of range). scenario=0, k=1000, vertex=2, label=1023
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	556 ms	768 KB	Wrong query response.
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	873 ms	1040 KB	Output is correct
2	Incorrect	645 ms	1048 KB	Wrong query response.
3	Halted	0 ms	0 KB	-

Subtask #5

0 / 61.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	557 ms	772 KB	Wrong query response.
2	Halted	0 ms	0 KB	-