oj.uz

Submission #47313

# Submission time Handle Problem Language Result Execution time Memory
47313 2018-04-30T13:37:39 Z ista2000 Computer Network (BOI14_network) C++17
0 / 100
 1000 ms 4376 KB 
#include <bits/stdc++.h>
#include "network.h"
using namespace std;

void findRoute (int n, int a, int b)
{
    /*
     *  Obviously, this is not a good solution.
     *  Replace it with your own code.
     */

    vector<int> v(n);
	for(int i = 0;i<n;i++)
		if(i!=b-1)
			v[i] = ping(i+1, b);
	int cur = a-1;
	while(cur!=b-1)
	{
		for(int i = 0;i<n;i++)
		{
			if(v[i]==v[cur]-1)
			{
				int x = ping(cur+1, i+1);
				if(!x)
				{
					travelTo(i+1);
					cur = i;
					break;
				}
			}
		}
	}
}

Compilation message

grader.c: In function 'int main()':
grader.c:48:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf ("%d%d%d%d", &N, &a, &b, &M);
     ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
grader.c:51:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &distance[u][v]);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1078 ms 4308 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1076 ms 4324 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1064 ms 4376 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1089 ms 4376 KB Time limit exceeded
2 Halted 0 ms 0 KB -