oj.uz

Submission #714728

# Submission time Handle Problem Language Result Execution time Memory
714728 2023-03-25T08:32:20 Z Iliya Toll (BOI17_toll) C++17
7 / 100
 3000 ms 6144 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 5e4 + 10;
const int Inf = 0x3f3f3f3f;
vector<pair<int, int>> Adj[N], Order;
int n, m, k, o, C[N], D[N], mark[N];
void DFS(int v, int comp) 
{
	mark[v] = true;
	C[v] = comp;
	for (auto [u, w] : Adj[v])
		D[u] = D[v] + w, DFS(u, comp);
}
signed main() 
{	
	scanf("%d%d%d%d", &k, &n, &m, &o);
	for (int i = 0; i < m; i++) 
	{
		int a, b, t;
		scanf("%d%d%d", &a, &b, &t);
		Adj[a].emplace_back(b, t);
	}
	for (int i = 0; i < o; i++)
	{
		int a, b;
		scanf("%d%d", &a, &b);
		Order.emplace_back(a, b);
	}
	for (int i = 0; i < n; i++) 
		if (!mark[i]) DFS(i, i);
	for (auto [u, v] : Order) 
	{
		if (u < v) swap(u, v);
		if (C[u] == C[v]) 
			printf("%d\n", D[u] - D[v]);
		else 
			printf("%d\n", -1);
	}
	return 0;
}

Compilation message

toll.cpp: In function 'int main()':
toll.cpp:17:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |  scanf("%d%d%d%d", &k, &n, &m, &o);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
toll.cpp:21:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |   scanf("%d%d%d", &a, &b, &t);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~
toll.cpp:27:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |   scanf("%d%d", &a, &b);
      |   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 6144 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct
3 Correct 2 ms 1488 KB Output is correct
4 Correct 1 ms 1488 KB Output is correct
5 Correct 2 ms 1492 KB Output is correct
6 Correct 2 ms 1524 KB Output is correct
7 Correct 2 ms 1656 KB Output is correct
8 Correct 22 ms 4308 KB Output is correct
9 Correct 22 ms 4040 KB Output is correct
10 Correct 5 ms 2140 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Incorrect 1 ms 1364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Incorrect 1 ms 1364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 6144 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct
3 Correct 2 ms 1488 KB Output is correct
4 Correct 1 ms 1488 KB Output is correct
5 Correct 2 ms 1492 KB Output is correct
6 Correct 2 ms 1524 KB Output is correct
7 Correct 2 ms 1656 KB Output is correct
8 Correct 22 ms 4308 KB Output is correct
9 Correct 22 ms 4040 KB Output is correct
10 Correct 5 ms 2140 KB Output is correct
11 Execution timed out 3067 ms 4052 KB Time limit exceeded
12 Halted 0 ms 0 KB -