제출 #1068626

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1068626		Abito	장난감 기차 (IOI17_train)	C++17	11 / 100	1763 ms	1648 KiB

train

#include "train.h"
#include <bits/stdc++.h>
//#define int long long
#define pb push_back
using namespace std;
const int N=5005;
int n,vis[N];
bool a[N],c[N],cyc[N],h;
vector<int> adj[N];
void dfs(int x){
	vis[x]=1;
	for (auto u:adj[x]){
		if (c[u]) continue;
		if (vis[u]==2) continue;
		if (vis[u]) h=1;
		else dfs(u);
	}vis[x]=2;
	return;
}
bool getans(int s){
	queue<int> q;
	q.push(s);
	vis[s]=1;
	bool ok=0;
	while (!q.empty()){
		int x=q.front();
		//cout<<x<<' ';
		q.pop();
		ok|=cyc[x];
		for (auto u:adj[x]){
			if (vis[u]) continue;
			else{
				vis[u]=1;
				q.push(u);
			}
		}
	}//cout<<endl;
	return ok;
}
std::vector<int32_t> who_wins(std::vector<int32_t> A, std::vector<int32_t> r, std::vector<int32_t> u, std::vector<int32_t> v) {
	n=A.size();
	for (int i=1;i<=n;i++) a[i]=A[i-1],c[i]=r[i-1];
	for (int i=0;i<u.size();i++){
		adj[u[i]+1].pb(v[i]+1);
	}
	vector<int> ans(n);
	for (int i=1;i<=n;i++){
		if (c[i]) continue;
		h=0;
		dfs(i);
		cyc[i]=h;
		memset(vis,0,sizeof(vis));
	}
	for (int i=1;i<=n;i++){
		ans[i-1]=!getans(i);
		memset(vis,0,sizeof(vis));
	}
	return ans;
}

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

train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:43:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |  for (int i=0;i<u.size();i++){
      |               ~^~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 11
• Subtask 4: 11 / 11
• Subtask 5: 0 / 12
• Subtask 6: 0 / 51