oj.uz

Submission #149625

# Submission time Handle Problem Language Result Execution time Memory
149625 2019-09-01T06:51:47 Z Fenwick_team(#3609, amiratou, AyaBenSaad, Nucleist) Bulb Game (FXCUP4_bulb) C++17
0 / 100
 2 ms 376 KB 
#include "bulb.h"
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define rando mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define fi first
#define se second
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define debugii(x) cerr << " - " << #x << ": " << x.fi<<","<<x.se << endl;
#define sep() cerr << "--------------------" << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define ii pair<int,int>
#define v vector<int>
#define vii vector<ii>
#define vv vector<vector<int> >
#define mp make_pair
#define INF 1000000000
#define pb push_back
#define EPS 1e-9
const int MOD = 1000000007; // 998244353
v LL,RR;
vector<int> state;
bool flow(int node){
	if(node<0){
		if(node==-2)return 1;
		return 0;
	}
	return flow((state[node]?RR[node]:LL[node]));
}

int FindWinner(int T, v L, v R){
	LL=L,RR=R;
	int N = L.size();
	state.resize(N);
	fill(all(state),0);
	for (int i = 0;i>=0; i=(state[i]?R[i]:L[i])){
		state[i]=1-state[i];
		bool f=1;
		for (int j = 0;j>=0; j=(state[j]?R[j]:L[j])){
			state[j]=1-state[j];
			if(flow((state[j]?R[j]:L[j])))f=0;
			state[j]=1-state[j];
		}
		if(f)return 1;
		state[i]=1-state[i];
	}
	return 0;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 64.0

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