oj.uz

Submission #84741

# Submission time Handle Problem Language Result Execution time Memory
84741 2018-11-17T04:44:30 Z kjh5678 None (KOI18_robot) C++14
0 / 100
 91 ms 16752 KB 
#if 01
#include <stdio.h>
#define MAX(x,y) ((x>y)?(x):(y))
int N, r1, r2;

typedef struct _idxarr
{
	int node;
	long long dist;
	_idxarr* next;
	_idxarr(){ node = dist = 0; next = (_idxarr*)0; };
	_idxarr(int a, long long b, _idxarr* c){ node = a; dist = b; next = c; }
}ia;

ia arr[100001];
long long dist[100001];
long long max[100001];
int visit[100001];

void input()
{
	scanf("%d %d %d", &N, &r1, &r2);
	for (int i = 1; i <= N; i++)
	{
		int x, y, v;
		scanf("%d%d%d", &x, &y, &v);
		arr[x].next = new ia(y, v, arr[x].next);

		arr[y].next = new ia(x, v, arr[y].next);
	}
}

void DFS(int node, long long d, long long m)
{
	dist[node] = d;
	max[node] = m;
	visit[node] = 1;
	for (ia* src = &arr[node]; src->next; src = src->next)
	{
		if (visit[src->next->node]) continue;
		DFS(src->next->node, d + src->next->dist, MAX(m, src->next->dist));
	}
}


int main()
{
	input();
	if (r1 == r2) { printf("0"); return 0; }
	DFS(r1, 0, 0);

	printf("%lld", dist[r2] - max[r2]);
}

#endif

Compilation message

robot.cpp: In function 'void input()':
robot.cpp:22:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d", &N, &r1, &r2);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
robot.cpp:26:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &x, &y, &v);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 14072 KB Output is correct
2 Correct 48 ms 14072 KB Output is correct
3 Correct 53 ms 14072 KB Output is correct
4 Correct 4 ms 14072 KB Output is correct
5 Correct 9 ms 14072 KB Output is correct
6 Correct 12 ms 14072 KB Output is correct
7 Runtime error 9 ms 14072 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Halted 0 ms 0 KB -

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 14072 KB Output is correct
2 Correct 48 ms 15172 KB Output is correct
3 Correct 4 ms 15172 KB Output is correct
4 Correct 5 ms 15172 KB Output is correct
5 Correct 13 ms 15172 KB Output is correct
6 Correct 10 ms 15172 KB Output is correct
7 Runtime error 7 ms 15172 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15172 KB Output is correct
2 Correct 4 ms 15172 KB Output is correct
3 Correct 4 ms 15172 KB Output is correct
4 Runtime error 7 ms 15172 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -

Subtask #4
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 15172 KB Output is correct
2 Correct 66 ms 15172 KB Output is correct
3 Correct 51 ms 16752 KB Output is correct
4 Correct 76 ms 16752 KB Output is correct
5 Correct 49 ms 16752 KB Output is correct
6 Correct 91 ms 16752 KB Output is correct
7 Correct 4 ms 16752 KB Output is correct
8 Correct 4 ms 16752 KB Output is correct
9 Correct 4 ms 16752 KB Output is correct
10 Correct 11 ms 16752 KB Output is correct
11 Correct 4 ms 16752 KB Output is correct
12 Correct 14 ms 16752 KB Output is correct
13 Correct 13 ms 16752 KB Output is correct
14 Correct 10 ms 16752 KB Output is correct
15 Runtime error 10 ms 16752 KB Execution killed with signal 11 (could be triggered by violating memory limits)
16 Halted 0 ms 0 KB -