Submission #146497

#TimeUsernameProblemLanguageResultExecution timeMemory
146497nekiToy Train (IOI17_train)C++14
0 / 100
13 ms2636 KiB
#include <bits/stdc++.h>
#include "train.h"
#define loop(i, a, b) for(int i=a;i<b;i++)
#define maxn 20100
using namespace std;
vector<int> ba[maxn], fo[maxn], ans, req;

void dfs(int u){loop(i, 0, ba[u].size()){ ba[u][i]--; if(ba[u][i]==0) dfs(ba[u][i]);}};

vector<int> who_wins(vector<int> A, vector<int> C, vector<int> U, vector<int> V){
  int n=A.size(), m=U.size();
  loop(i, 0, m) ba[V[i]].push_back(U[i]), fo[U[i]].push_back(V[i]);
  ans.resize(n, 1), req.resize(n);
  
  bool cn=1;
  while(cn){
    cn=0;
    loop(i, 0, n) req[i]=(A[i])? 1:fo[i].size();
    loop(i, 0, n) if(C[i]&&ans[i]) dfs(i);
    loop(i, 0, n) if(ans[i]!=(req[i]<1)) ans[i]=(req[i]<1), cn=1;
  }
  return ans;
}

Compilation message (stderr)

train.cpp: In function 'void dfs(int)':
train.cpp:3:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define loop(i, a, b) for(int i=a;i<b;i++)
train.cpp:8:22:
 void dfs(int u){loop(i, 0, ba[u].size()){ ba[u][i]--; if(ba[u][i]==0) dfs(ba[u][i]);}};
                      ~~~~~~~~~~~~~~~~~~
train.cpp:8:17: note: in expansion of macro 'loop'
 void dfs(int u){loop(i, 0, ba[u].size()){ ba[u][i]--; if(ba[u][i]==0) dfs(ba[u][i]);}};
                 ^~~~
#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...