oj.uz

Submission #149744

# Submission time Handle Problem Language Result Execution time Memory
149744 2019-09-01T07:04:22 Z 갓띵건(#3694, gs18103, sjimed, gs18065) Bulb Game (FXCUP4_bulb) C++17
11 / 100
 2 ms 376 KB 
#include "bulb.h"
#include<bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(false);cin.tie(0)
#define fi first
#define se second
#define eb emplace_back
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define pre(a) cout<<fixed;cout.precision(a)

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e9;
const ll INF = 1e18;

int n;
vector<int> l, r;

int dfs(int x) {
	if(x < 0) return x;
	return dfs(l[x]);
}

int FindWinner(int T, std::vector<int> L, std::vector<int> R){
	n = L.size();
	l = L;
	r = R;

	bool flag = true;
	for(int j=0; j>=0; j = l[j]) {
		if(l[j] == -2) flag = false;
		if(dfs(r[j]) == -2) flag = false;
	}
	if(flag) return 1;

	for(int i=0; i<n; i++) {
		swap(l[i], r[i]);

		flag = true;
		for(int j=0; j>=0; j = l[j]) {
			if(l[j] == -2) flag = false;
			if(dfs(r[j]) == -2) flag = false;
		}

		swap(l[i], r[i]);

		if(flag) return 1;
	}

	return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct

Subtask #2
0 / 25.0

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

Subtask #3
0 / 64.0

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