oj.uz

답안 #406948

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
406948 2021-05-18T09:09:27 Z Kevin_Zhang_TW 장난감 기차 (IOI17_train) C++17
5 / 100
 2000 ms 9312 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 belong[MAX_N];
vector<int> edge[MAX_N];

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

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

	bool ret = true;

	// 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;
			}
		}
		DE(x, dp[x]);
		if (dp[x] != s) {
			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;
			}
		}
		DE(x, dp[x]);
		if (dp[x] != s) {
			ret = false;
			dp[x] = -1;
		}
	}

	if (ret == false) {
		int u;
		do {
			u = allstk.back();
			dp[x] = -1;
			allstk.pop_back();
		} while (u != x) ;
	}
	
	stk.pop_back();
	inst[x] = false;

	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(dp, -1, sizeof(dp));

	vector<int> res(n);
	for (int i = 0;i < n;++i) {
		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:54:3: note: in expansion of macro 'DE'
   54 |   DE(x, dp[x]);
      |   ^~
train.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
train.cpp:71:5: note: in expansion of macro 'DE'
   71 |     DE(u, 0);
      |     ^~
train.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
train.cpp:76:3: note: in expansion of macro 'DE'
   76 |   DE(x, dp[x]);
      |   ^~
train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:104:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |  for (int i = 0;i < u.size();++i) {
      |                 ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 8908 KB Output is correct
2 Correct 10 ms 8908 KB Output is correct
3 Correct 9 ms 8908 KB Output is correct
4 Correct 10 ms 8908 KB Output is correct
5 Correct 10 ms 8972 KB Output is correct
6 Correct 10 ms 8956 KB Output is correct
7 Correct 9 ms 8916 KB Output is correct
8 Correct 9 ms 9036 KB Output is correct
9 Correct 9 ms 8972 KB Output is correct
10 Correct 9 ms 8908 KB Output is correct
11 Correct 9 ms 8956 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2075 ms 9204 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2033 ms 9312 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 15 ms 9292 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 10 ms 8908 KB Output is correct
2 Correct 10 ms 8908 KB Output is correct
3 Correct 9 ms 8908 KB Output is correct
4 Correct 10 ms 8908 KB Output is correct
5 Correct 10 ms 8972 KB Output is correct
6 Correct 10 ms 8956 KB Output is correct
7 Correct 9 ms 8916 KB Output is correct
8 Correct 9 ms 9036 KB Output is correct
9 Correct 9 ms 8972 KB Output is correct
10 Correct 9 ms 8908 KB Output is correct
11 Correct 9 ms 8956 KB Output is correct
12 Correct 6 ms 8652 KB Output is correct
13 Correct 5 ms 8524 KB Output is correct
14 Correct 7 ms 8448 KB Output is correct
15 Correct 5 ms 8524 KB Output is correct
16 Correct 6 ms 8524 KB Output is correct
17 Correct 6 ms 8524 KB Output is correct
18 Correct 6 ms 8524 KB Output is correct
19 Incorrect 6 ms 8524 KB 3rd lines differ - on the 2nd token, expected: '0', found: '1'
20 Halted 0 ms 0 KB -