제출 #64819

#제출 시각아이디문제언어결과실행 시간메모리
64819mohammad_kilani장난감 기차 (IOI17_train)C++17
11 / 100
1234 ms5600 KiB
#include "train.h" #include <bits/stdc++.h> using namespace std; const int N = 5010; vector< int > res , a , g[N] , r; int n , vis[N] , vi = 0 , last; bool DFS(int node){ vis[node] = vi; if(node == last) return true; for(int i=0;i<g[node].size();i++){ if(vis[g[node][i]] != vi && a[g[node][i]] == a[last]){ if(DFS(g[node][i])) return true; } } return false; } bool DFS2(int node){ vis[node] = vi; if(res[node] == a[last]) return true; for(int i=0;i<g[node].size();i++){ if(vis[g[node][i]] != vi && a[g[node][i]] == a[last]){ if(DFS2(g[node][i])) return true; } } return false; } bool DFS3(int node){ vis[node] = vi; if(res[node] != -1) return false; if(a[node] != a[last]) return true; for(int i=0;i<g[node].size();i++){ if(vis[g[node][i]] != vi) if(DFS3(g[node][i])) return true; } return false; } std::vector<int> who_wins(std::vector<int> A, std::vector<int> R, std::vector<int> u, std::vector<int> v) { a = A; n = (int)a.size(); r = R; res.resize(n , -1); for(int i = 0;i<(int)u.size();i++){ g[u[i]].push_back(v[i]); } for(int i=0;i<n;i++){ last = i; vi++; if(a[i] == 0 || r[i]){ for(int j = 0;j<g[i].size();j++){ if(a[g[i][j]] == a[i] && vis[g[i][j]] != vi && DFS(g[i][j])){ res[i] = a[i]; break; } } } } for(int i=0;i<n;i++){ if(res[i] != -1) continue; last = i; vi++; if(DFS2(i)) res[i] = a[i]; } for(int i=0;i<n;i++){ if(res[i] == -1){ vi++; last = i; if(!DFS3(i)) res[i] = a[i] ^ 1; } } return res; }

컴파일 시 표준 에러 (stderr) 메시지

train.cpp: In function 'bool DFS(int)':
train.cpp:12:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[node].size();i++){
              ~^~~~~~~~~~~~~~~
train.cpp: In function 'bool DFS2(int)':
train.cpp:25:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[node].size();i++){
              ~^~~~~~~~~~~~~~~
train.cpp: In function 'bool DFS3(int)':
train.cpp:40:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[node].size();i++){
              ~^~~~~~~~~~~~~~~
train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:60:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int j = 0;j<g[i].size();j++){
                  ~^~~~~~~~~~~~
#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...