답안 #28791 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
28791	2017-07-17T08:06:13 Z	dereotu	경주 (Race) (IOI11_race)	C++14	21 / 100	38 ms	3196 KB

race

#include "race.h"
#include <bits/stdc++.h>
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define forr(i,A,B) for(int i=A;i<B;++i)
#define space ' '
#define endl '\n'
#define LL long long
using namespace std;

vector <pair<int,int> > adj[1005];

int k,ans=1e9;

void dfs(int x,int y,int len,int step);

int best_path(int N, int K, int H[][2], int L[])
{
	for(int i=0;i<N;i++){
		adj[H[i][0]].pb(mp(L[i],H[i][1]));
		adj[H[i][1]].pb(mp(L[i],H[i][0]));
	}
	k=K;
	for(int i=0;i<N;i++){
		dfs(i,-1,0,0);
	}
	if(ans==1e9) return -1;
	else return ans;
}

void dfs(int x,int y,int len,int step){
	if(len==k){
		ans=min(ans,step);
		return;
	}
	for(int i=0;i<adj[x].size();i++){
		if(adj[x][i].nd!=y and adj[x][i].nd!=x){
			dfs(adj[x][i].nd,x,adj[x][i].st+len,step+1);
		}
	}
}

Compilation message

race.cpp: In function 'void dfs(int, int, int, int)':
race.cpp:39:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<adj[x].size();i++){
              ~^~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	2 ms	484 KB	Output is correct
4	Correct	2 ms	484 KB	Output is correct
5	Correct	2 ms	576 KB	Output is correct
6	Correct	2 ms	576 KB	Output is correct
7	Correct	2 ms	576 KB	Output is correct
8	Correct	2 ms	576 KB	Output is correct
9	Correct	2 ms	576 KB	Output is correct
10	Correct	2 ms	576 KB	Output is correct
11	Correct	2 ms	576 KB	Output is correct
12	Correct	2 ms	576 KB	Output is correct
13	Correct	2 ms	576 KB	Output is correct
14	Correct	2 ms	576 KB	Output is correct
15	Correct	2 ms	576 KB	Output is correct
16	Correct	2 ms	612 KB	Output is correct
17	Correct	3 ms	612 KB	Output is correct
18	Correct	2 ms	612 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	2 ms	484 KB	Output is correct
4	Correct	2 ms	484 KB	Output is correct
5	Correct	2 ms	576 KB	Output is correct
6	Correct	2 ms	576 KB	Output is correct
7	Correct	2 ms	576 KB	Output is correct
8	Correct	2 ms	576 KB	Output is correct
9	Correct	2 ms	576 KB	Output is correct
10	Correct	2 ms	576 KB	Output is correct
11	Correct	2 ms	576 KB	Output is correct
12	Correct	2 ms	576 KB	Output is correct
13	Correct	2 ms	576 KB	Output is correct
14	Correct	2 ms	576 KB	Output is correct
15	Correct	2 ms	576 KB	Output is correct
16	Correct	2 ms	612 KB	Output is correct
17	Correct	3 ms	612 KB	Output is correct
18	Correct	2 ms	612 KB	Output is correct
19	Correct	2 ms	612 KB	Output is correct
20	Correct	2 ms	612 KB	Output is correct
21	Correct	15 ms	612 KB	Output is correct
22	Correct	17 ms	748 KB	Output is correct
23	Correct	19 ms	748 KB	Output is correct
24	Correct	14 ms	748 KB	Output is correct
25	Correct	17 ms	748 KB	Output is correct
26	Correct	15 ms	748 KB	Output is correct
27	Correct	17 ms	748 KB	Output is correct
28	Correct	16 ms	748 KB	Output is correct
29	Correct	14 ms	748 KB	Output is correct
30	Correct	14 ms	748 KB	Output is correct
31	Correct	14 ms	748 KB	Output is correct
32	Correct	15 ms	748 KB	Output is correct
33	Correct	15 ms	748 KB	Output is correct
34	Correct	14 ms	748 KB	Output is correct
35	Correct	14 ms	764 KB	Output is correct
36	Correct	12 ms	764 KB	Output is correct
37	Correct	12 ms	764 KB	Output is correct
38	Correct	14 ms	764 KB	Output is correct

Subtask #3
0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	2 ms	484 KB	Output is correct
4	Correct	2 ms	484 KB	Output is correct
5	Correct	2 ms	576 KB	Output is correct
6	Correct	2 ms	576 KB	Output is correct
7	Correct	2 ms	576 KB	Output is correct
8	Correct	2 ms	576 KB	Output is correct
9	Correct	2 ms	576 KB	Output is correct
10	Correct	2 ms	576 KB	Output is correct
11	Correct	2 ms	576 KB	Output is correct
12	Correct	2 ms	576 KB	Output is correct
13	Correct	2 ms	576 KB	Output is correct
14	Correct	2 ms	576 KB	Output is correct
15	Correct	2 ms	576 KB	Output is correct
16	Correct	2 ms	612 KB	Output is correct
17	Correct	3 ms	612 KB	Output is correct
18	Correct	2 ms	612 KB	Output is correct
19	Runtime error	38 ms	3196 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
20	Halted	0 ms	0 KB	-

Subtask #4
0 / 57.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	2 ms	484 KB	Output is correct
4	Correct	2 ms	484 KB	Output is correct
5	Correct	2 ms	576 KB	Output is correct
6	Correct	2 ms	576 KB	Output is correct
7	Correct	2 ms	576 KB	Output is correct
8	Correct	2 ms	576 KB	Output is correct
9	Correct	2 ms	576 KB	Output is correct
10	Correct	2 ms	576 KB	Output is correct
11	Correct	2 ms	576 KB	Output is correct
12	Correct	2 ms	576 KB	Output is correct
13	Correct	2 ms	576 KB	Output is correct
14	Correct	2 ms	576 KB	Output is correct
15	Correct	2 ms	576 KB	Output is correct
16	Correct	2 ms	612 KB	Output is correct
17	Correct	3 ms	612 KB	Output is correct
18	Correct	2 ms	612 KB	Output is correct
19	Correct	2 ms	612 KB	Output is correct
20	Correct	2 ms	612 KB	Output is correct
21	Correct	15 ms	612 KB	Output is correct
22	Correct	17 ms	748 KB	Output is correct
23	Correct	19 ms	748 KB	Output is correct
24	Correct	14 ms	748 KB	Output is correct
25	Correct	17 ms	748 KB	Output is correct
26	Correct	15 ms	748 KB	Output is correct
27	Correct	17 ms	748 KB	Output is correct
28	Correct	16 ms	748 KB	Output is correct
29	Correct	14 ms	748 KB	Output is correct
30	Correct	14 ms	748 KB	Output is correct
31	Correct	14 ms	748 KB	Output is correct
32	Correct	15 ms	748 KB	Output is correct
33	Correct	15 ms	748 KB	Output is correct
34	Correct	14 ms	748 KB	Output is correct
35	Correct	14 ms	764 KB	Output is correct
36	Correct	12 ms	764 KB	Output is correct
37	Correct	12 ms	764 KB	Output is correct
38	Correct	14 ms	764 KB	Output is correct
39	Runtime error	38 ms	3196 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
40	Halted	0 ms	0 KB	-

답안 #28791

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 12.0 / 12.0

Subtask #3 0 / 22.0

Subtask #4 0 / 57.0

Subtask #1
9.0 / 9.0

Subtask #2
12.0 / 12.0

Subtask #3
0 / 22.0

Subtask #4
0 / 57.0