이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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, po;
void dfs(int u){loop(i, 0, ba[u].size()){ ba[u][i]--; if(!ba[u][i] && !po[i]) 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();po.resize(n);loop(i, 0, n) po[i]=C[i];
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(po[i]&&ans[i]) dfs(i);
loop(i, 0, n) if(ans[i]!=(req[i]<1)) ans[i]=(req[i]<1), cn=1;
}
return ans;
}
컴파일 시 표준 에러 (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] && !po[i]) 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] && !po[i]) dfs(ba[u][i]);}};
^~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |