Submission #1571162
Source Code Expand
//http://agc010.contest.atcoder.jp/tasks/agc010_c?lang=en #include <bits/stdc++.h> using namespace std; typedef pair< int, int > pii; typedef long long ll; const int MAXN = 1e5 + 10; int n, A[ MAXN ], deg[ MAXN ]; vector< int > graph[ MAXN ]; map< pii, ll > edge; bool visited[ MAXN ]; bool check( int u ){ if( graph[ u ].size() == 1 ) return edge[ make_pair( min( u, graph[ u ][ 0 ] ), max( u, graph[ u ][ 0 ] ) ) ] == A[ u ]; ll sum = 0; for( int i = 0; i < graph[ u ].size(); ++i ){ ll val = edge[ make_pair( min( u, graph[ u ][ i ] ), max( u, graph[ u ][ i ] ) ) ]; if( val > A[ u ] ) return false; sum += val; } return sum == (A[ u ] << 1); } int main(){ scanf( "%d", &n ); for( int i = 1; i <= n; ++i ) scanf( "%d", &A[i] ); for( int i = 1, a, b; i < n; ++i ){ scanf( "%d%d", &a, &b ); graph[ a ].push_back( b ); graph[ b ].push_back( a ); ++deg[ a ]; ++deg[ b ]; } queue< int > q; for( int i = 1; i <= n; ++i ) if( deg[ i ] == 1 ) q.push( i ); bool flag = true; while( flag && !q.empty() ){ int u = q.front(); q.pop(); //cout << u << endl; visited[ u ] = true; ll sum = 0; int v = -1; for( int i = 0; i < graph[ u ].size(); ++i ){ int ne = graph[ u ][ i ]; if( visited[ ne ] ) sum += edge[ make_pair( min( u, ne ), max( ne, u ) ) ]; else v = ne; } if( v != -1 ){ --deg[ v ]; if( deg[ v ] == 1 ) q.push( v ); if( graph[ u ].size() == 1 ){ edge[ make_pair( min( u, v ), max( u, v ) ) ] = A[ u ]; } else{ if( (A[ u ] << 1) < sum ) flag = false; else edge[ make_pair( min( u, v ), max( u, v ) ) ] = (A[ u ] << 1) - sum; } } } /*for( map< pii, ll >::iterator it = edge.begin(); it != edge.end(); ++it ){ cout << (it->first).first << '-' << (it->first).second << ": " << it->second << endl; }*/ if( flag ) for( int i = 1; i <= n && flag; ++i ) flag = check( i ); if( flag ) puts( "YES" ); else puts( "NO" ); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Cleaning |
User | vjudge5 |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1933 Byte |
Status | AC |
Exec Time | 140 ms |
Memory | 12928 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:29:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf( "%d", &n ); ^ ./Main.cpp:30:52: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for( int i = 1; i <= n; ++i ) scanf( "%d", &A[i] ); ^ ./Main.cpp:32:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf( "%d%d", &a, &b ); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 700 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
All | sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in3.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in4.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 135 ms | 12928 KB |
in10.txt | AC | 135 ms | 12928 KB |
in11.txt | AC | 125 ms | 12800 KB |
in12.txt | AC | 125 ms | 12800 KB |
in13.txt | AC | 120 ms | 12800 KB |
in14.txt | AC | 120 ms | 12800 KB |
in15.txt | AC | 2 ms | 2560 KB |
in16.txt | AC | 2 ms | 2560 KB |
in17.txt | AC | 2 ms | 2560 KB |
in18.txt | AC | 2 ms | 2560 KB |
in19.txt | AC | 125 ms | 12928 KB |
in2.txt | AC | 135 ms | 12928 KB |
in20.txt | AC | 101 ms | 12928 KB |
in21.txt | AC | 102 ms | 12928 KB |
in22.txt | AC | 113 ms | 12928 KB |
in23.txt | AC | 131 ms | 12928 KB |
in24.txt | AC | 114 ms | 12928 KB |
in25.txt | AC | 2 ms | 2560 KB |
in26.txt | AC | 61 ms | 9984 KB |
in27.txt | AC | 60 ms | 9984 KB |
in28.txt | AC | 2 ms | 2560 KB |
in29.txt | AC | 56 ms | 9984 KB |
in3.txt | AC | 134 ms | 12928 KB |
in30.txt | AC | 2 ms | 2560 KB |
in31.txt | AC | 102 ms | 12928 KB |
in32.txt | AC | 100 ms | 12928 KB |
in33.txt | AC | 137 ms | 12928 KB |
in34.txt | AC | 140 ms | 12928 KB |
in35.txt | AC | 104 ms | 12928 KB |
in36.txt | AC | 100 ms | 12928 KB |
in37.txt | AC | 3 ms | 2688 KB |
in38.txt | AC | 73 ms | 11264 KB |
in39.txt | AC | 72 ms | 11264 KB |
in4.txt | AC | 134 ms | 12928 KB |
in40.txt | AC | 76 ms | 11264 KB |
in41.txt | AC | 72 ms | 11264 KB |
in42.txt | AC | 107 ms | 12928 KB |
in43.txt | AC | 101 ms | 12928 KB |
in44.txt | AC | 101 ms | 12928 KB |
in45.txt | AC | 107 ms | 12928 KB |
in5.txt | AC | 134 ms | 12928 KB |
in6.txt | AC | 134 ms | 12928 KB |
in7.txt | AC | 118 ms | 11904 KB |
in8.txt | AC | 28 ms | 4992 KB |
in9.txt | AC | 134 ms | 12928 KB |
sample1.txt | AC | 2 ms | 2560 KB |
sample2.txt | AC | 2 ms | 2560 KB |
sample3.txt | AC | 2 ms | 2560 KB |