Submission #211241

#	Time	Username	Problem	Language	Result	Execution time	Memory
211241		Lawliet	Magic Tree (CEOI19_magictree)	C++14	3 / 100	58 ms	2808 KiB

magictree

#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 (stderr)

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
• Subtask 2: 3 / 3
• Subtask 3: 0 / 11
• Subtask 4: 0 / 12
• Subtask 5: 0 / 16
• Subtask 6: 0 / 13
• Subtask 7: 0 / 22
• Subtask 8: 0 / 17