oj.uz

Submission #970488

# Submission time Handle Problem Language Result Execution time Memory
970488 2024-04-26T15:47:10 Z thunopro The Xana coup (BOI21_xanadu) C++14
10 / 100
 34 ms 10076 KB 
#include<bits/stdc++.h>
using namespace std ; 
#define maxn 200009
#define ll long long 
#define pb push_back 
#define fi first 
#define se second 
#define left id<<1
#define right id<<1|1 
#define re exit(0); 
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1
const int mod = 1e9+7 ;
const int INF = 1e9 ; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ; 

template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; } 
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; } 

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a >= mod ) a -= mod ; 
	if ( a < 0 ) a += mod ; 
}

void rf () 
{
	freopen ("bai1.inp","r",stdin) ;
}

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow (a,n/2) ; 
	if ( n % 2 ) return 1ll*res*res%mod*a%mod ; 
	else return 1ll*res*res%mod ; 
}

int n ; 
vi adjList [maxn] ; 
int light [maxn] ; 

void sub1 () 
{
	int res = 0 ; 
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		if ( light [i] == 1 ) 
		{
			if ( i == n ) 
			{
				cout << "impossible" ; re 
			}
			light [i+1] ^= 1 ; 
			if ( i+2 <= n ) light [i+2] ^= 1 ; 
			res ++ ; 
		}	
	}
	cout << res ; 
}
int main () 
{
	ios_base::sync_with_stdio(0); 
	cin.tie(0);cout.tie(0); 
//	rf () ; 
	cin >> n ; 
	for ( int i = 1 ; i < n ; i ++ ) 
	{ 
		int u , v ; cin >> u >> v ; 
		adjList [u] . pb (v) ; adjList [v] . pb (u) ; 
	}
	for ( int i = 1 ; i <= n ; i ++ ) cin >> light [i] ; 
	sub1 () ; 
}

Compilation message

xanadu.cpp: In function 'void rf()':
xanadu.cpp:31:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

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

Subtask #2
0 / 15.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 10076 KB Output is correct
2 Correct 34 ms 10012 KB Output is correct
3 Correct 26 ms 10068 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 9820 KB Output is correct
2 Correct 25 ms 9860 KB Output is correct
3 Correct 29 ms 10008 KB Output is correct
4 Correct 25 ms 9308 KB Output is correct
5 Correct 30 ms 10068 KB Output is correct
6 Correct 33 ms 10076 KB Output is correct
7 Incorrect 2 ms 5724 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

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