oj.uz

답안 #149309

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
149309 2019-09-01T06:11:51 Z 还没编好(#3801, cauchysheep, fjzzq2002, apiad) Bulb Game (FXCUP4_bulb) C++17
0 / 100
 3 ms 508 KB 
#include "bulb.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=301000;
VI l,r;
int n,fg,saf[N],tsaf,vis[N];

void dfs(int u,int par,int dep,VI pt) {
	if (SZ(pt)>2) return;
	if (u<0) {
		if (u!=-2) return;
		if (SZ(pt)==0) {
			fg=1;
		} else if (SZ(pt)==2) {
			vis[pt[0]]=1; vis[pt[1]]=1;
		} else {
			if (dep==n) return;
			vis[pt[0]]=1;
			saf[par]++;
			tsaf++;
		}
	} else {
		dfs(l[u],u,dep+1,pt);
		pt.pb(u);
		dfs(r[u],u,dep+1,pt);
		if (l[u]>=0) saf[par]+=saf[l[u]];
		if (r[u]>=0) saf[par]+=saf[r[u]];
	}
}

int FindWinner(int T, std::vector<int> L, std::vector<int> R){
	l=L; r=R;
	n=L.size();
	dfs(0,0,0,VI(0));
	if (fg) return 0;
	rep(i,0,n) if (!vis[i]&&saf[i]==tsaf) return 1;
	return 0;
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 508 KB Output is correct
6 Correct 2 ms 368 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 2 ms 296 KB Output is correct
10 Correct 2 ms 380 KB Output is correct
11 Incorrect 2 ms 376 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 252 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 380 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 508 KB Output is correct
8 Correct 2 ms 368 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 2 ms 296 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Incorrect 2 ms 376 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
0 / 64.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 252 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 380 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 508 KB Output is correct
8 Correct 2 ms 368 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 2 ms 296 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Incorrect 2 ms 376 KB Output isn't correct
14 Halted 0 ms 0 KB -