Submission #430544

#TimeUsernameProblemLanguageResultExecution timeMemory
430544rainboyToy Train (IOI17_train)C++98
38 / 100
2045 ms105628 KiB
#include "train.h" #include <stdlib.h> using namespace std; const int N = 5000; typedef vector<int> vi; int *ej[N], eo[N]; void append(int i, int j) { int o = eo[i]++; if (o >= 2 && (o & o - 1) == 0) ej[i] = (int *) realloc(ej[i], o * 2 * sizeof *ej[i]); ej[i][o] = j; } int dd[N][N + 1], out[N], n; vi rr; void dfs(int i, int t) { int o; if (--dd[i][t] != 0) return; dd[i][t] = -1; for (o = eo[i]; o--; ) { int j = ej[i][o], t_; if (t != n) dfs(j, t + 1); else if (rr[i]) for (t_ = 1; t_ <= n; t_++) dfs(j, t_); } } vi who_wins(vi aa, vi rr_, vi uu, vi vv) { int m = uu.size(), h, i, j, t; vi ans(n = aa.size()); rr = rr_; for (i = 0; i < n; i++) ej[i] = (int *) malloc(2 * sizeof *ej[i]); for (h = 0; h < m; h++) { append(vv[h], uu[h]); out[uu[h]]++; } for (i = 0; i < n; i++) { dd[i][0] = !rr[i] ? 1 : 0; for (t = 1; t <= n; t++) dd[i][t] = t == n || !rr[i] ? (aa[i] ? out[i] : 1) : 0; } for (i = 0; i < n; i++) dfs(i, 0); for (i = 0; i < n; i++) ans[i] = dd[i][n] >= 0; return ans; }

Compilation message (stderr)

train.cpp: In function 'void append(int, int)':
train.cpp:15:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   15 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~
train.cpp: In function 'vi who_wins(vi, vi, vi, vi)':
train.cpp:41:27: warning: unused variable 'j' [-Wunused-variable]
   41 |  int m = uu.size(), h, i, j, t;
      |                           ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...