oj.uz

Submission #211241

# Submission time Handle Problem Language Result Execution time Memory
211241 2020-03-19T17:47:47 Z Lawliet Magic Tree (CEOI19_magictree) C++14
3 / 100
 58 ms 2808 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long int lli;

int n, m, k;

int main()
{
	scanf("%d %d %d",&n,&m,&k);

	lli ans = 0;

	for(int i = 2 ; i <= n ; i++)
		scanf("%d",&k);

	for(int i = 1 ; i <= m ; i++)
	{
		int w;
		scanf("%d %d %d",&k,&k,&w);

		ans += w;
	}

	printf("%lld\n",ans);
}

Compilation message

magictree.cpp: In function 'int main()':
magictree.cpp:10:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d",&n,&m,&k);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~
magictree.cpp:15:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&k);
   ~~~~~^~~~~~~~~
magictree.cpp:20:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d",&k,&k,&w);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 640 KB Output is correct
2 Correct 29 ms 1280 KB Output is correct
3 Correct 58 ms 2808 KB Output is correct
4 Correct 56 ms 2424 KB Output is correct
5 Correct 58 ms 2680 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 56 ms 760 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -