oj.uz

답안 #406911

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
406911 2021-05-18T08:17:05 Z Kevin_Zhang_TW 장난감 기차 (IOI17_train) C++17
5 / 100
 245 ms 10700 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif

const int MAX_N = 300010;

#include "train.h"

int dp[MAX_N], w[MAX_N], sum[MAX_N], inst[MAX_N], n;
int sure[MAX_N];

int belong[MAX_N];
vector<int> edge[MAX_N];

bool dfs(int x, int s, int v = 0) {
	static vector<int> stk;
	if (sure[x] != -1) return sure[x] == s;
	if (dp[x] != -1) return dp[x] == s;

	stk.pb(x);
	inst[x] = true;
	v += w[x];
	sum[x] = v;
	bool ret = true;

	DE(x, s, v);

	// A owns it
	if (belong[x] == 1) {
		dp[x] = 0;
		for (int u : edge[x]) {
			if (dp[u] != -1 && inst[u]) {
				if (w[u] || sum[x] != sum[u]) {
					dp[x] = 1;
					break;
				}
			}
			if (inst[u]) continue;
			if (dfs(u, 1, v)) {
				dp[x] = 1;
				break;
			}
		}
		if (dp[x] != s) {
			sure[x] = dp[x];
			ret = false;
			dp[x] = -1;
		}
	}
	else {
		dp[x] = 1;
		for (int u : edge[x]) {
			if (dp[u] != -1 && inst[u]) {
				if (w[u] == 0 && sum[x] == sum[u]) {
					dp[x] = 0;
					break;
				}
			}
			if (inst[u]) continue;
			if (dfs(u, 0, v)) {
				DE(u, 0);
				dp[x] = 0;
				break;
			}
		}
		if (dp[x] != s) {
			sure[x] = dp[x];
			ret = false;
			dp[x] = -1;
		}
	}
	
	stk.pop_back();
	inst[x] = false;
	dp[x] = -1;

	return ret;
}

std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
	n = a.size();
	for (int i = 0;i < n;++i) {
		w[i] = r[i];
		belong[i] = a[i];
	}
	for (int i = 0;i < u.size();++i) {
		edge[ u[i] ].pb( v[i] );
	}

	memset(sure, -1, sizeof(sure));

	vector<int> res(n);
	for (int i = 0;i < n;++i) {
		memset(dp, -1, sizeof(dp));
		res[i] = dfs(i, 1);
	}

	return res;
}

Compilation message

train.cpp: In function 'bool dfs(int, int, int)':
train.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
train.cpp:39:2: note: in expansion of macro 'DE'
   39 |  DE(x, s, v);
      |  ^~
train.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
train.cpp:74:5: note: in expansion of macro 'DE'
   74 |     DE(u, 0);
      |     ^~
train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:99:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |  for (int i = 0;i < u.size();++i) {
      |                 ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 216 ms 10112 KB Output is correct
2 Correct 215 ms 10068 KB Output is correct
3 Correct 215 ms 10096 KB Output is correct
4 Correct 212 ms 10144 KB Output is correct
5 Correct 221 ms 10100 KB Output is correct
6 Correct 215 ms 10084 KB Output is correct
7 Correct 216 ms 10092 KB Output is correct
8 Correct 217 ms 10092 KB Output is correct
9 Correct 213 ms 10060 KB Output is correct
10 Correct 212 ms 10088 KB Output is correct
11 Correct 217 ms 10080 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9676 KB Output is correct
2 Correct 8 ms 9676 KB Output is correct
3 Incorrect 7 ms 9676 KB 3rd lines differ - on the 6th token, expected: '0', found: '1'
4 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 214 ms 10664 KB Output is correct
2 Correct 217 ms 10612 KB Output is correct
3 Correct 221 ms 10700 KB Output is correct
4 Correct 243 ms 10420 KB Output is correct
5 Correct 245 ms 10404 KB Output is correct
6 Incorrect 215 ms 10444 KB 3rd lines differ - on the 200th token, expected: '1', found: '0'
7 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 218 ms 10564 KB Output is correct
2 Correct 222 ms 10508 KB Output is correct
3 Incorrect 218 ms 10612 KB 3rd lines differ - on the 25th token, expected: '0', found: '1'
4 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 218 ms 10448 KB 3rd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 216 ms 10112 KB Output is correct
2 Correct 215 ms 10068 KB Output is correct
3 Correct 215 ms 10096 KB Output is correct
4 Correct 212 ms 10144 KB Output is correct
5 Correct 221 ms 10100 KB Output is correct
6 Correct 215 ms 10084 KB Output is correct
7 Correct 216 ms 10092 KB Output is correct
8 Correct 217 ms 10092 KB Output is correct
9 Correct 213 ms 10060 KB Output is correct
10 Correct 212 ms 10088 KB Output is correct
11 Correct 217 ms 10080 KB Output is correct
12 Correct 7 ms 9676 KB Output is correct
13 Correct 8 ms 9676 KB Output is correct
14 Incorrect 7 ms 9676 KB 3rd lines differ - on the 6th token, expected: '0', found: '1'
15 Halted 0 ms 0 KB -