제출 #775730

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
775730		APROHACK	장난감 기차 (IOI17_train)	C++14	39 / 100	201 ms	1628 KiB

train

#include "train.h"
#include<bits/stdc++.h>
#define pb push_back
#define ll long long
#define ff first
#define ss second
using namespace std;
int contNode[5001];
bool isFA[5001];
bool isFB[5001];
bool owner[5001], rechargable[5001], vis[5001];
bool answered[5001];
vector<int>adj[5001], inv[5001];
int n, m;

void restart(){
	for(int i = 0 ; i < n; i ++){
		isFA[i] = false;
		isFB[i] = false;
		vis[i] = false;
		//contNode[i] = 0;
	}
}
void restart2(){
	for(int i = 0 ; i < n; i ++){
		//isFA[i] = false;
		//isFB[i] = false;
		vis[i] = false;
		//contNode[i] = 0;
	}
}
void getA(){
	queue<int>llegado;
	for(int i = 0 ; i < n ;i ++){
		if(rechargable[i] and !answered[i]){
			llegado.push(i);
			isFA[i] = true;
			vis[i] = true;
		}
	}
	//cout << "fa" << endl;
	while(!llegado.empty()){
		int cur = llegado.front();
		llegado.pop();
		int v;
		for(int i = 0 ; i < inv[cur].size() ; i ++){
			v = inv[cur][i];
			if(vis[v] or answered[v])continue;
			if(owner[v] or contNode[v] + 1 == adj[v].size()){
				llegado.push(v);
				isFA[v] = true;
				vis[v] = true;
				//cout << v << endl;
			}else if(!owner[v])contNode[v] ++;
		}
	}
	//cout << endl;
}
void getB(){
	queue<int>llegado;
	for(int i = 0 ; i < n ; i ++){
		if(!isFA[i] and !answered[i]){
			isFB[i] = true;
			llegado.push(i);
			vis[i] = true;
		}
	}
	while(!llegado.empty()){
		int cur = llegado.front();
		llegado.pop();
		int v;
		for(int i = 0 ; i < inv[cur].size() ; i ++){
			v = inv[cur][i];
			if(vis[v] or answered[v])continue;
			if(!owner[v] or contNode[v] + 1 == adj[v].size()){
				llegado.push(v);
				isFB[v] = true;
				vis[v] = true;
			}else if(owner[v])contNode[v] ++;
		}
	}
	
}

std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
	n = r.size();
	m = u.size();
	vector<int>ans;
	for(int i = 0 ; i < n ;i ++){
		owner[i] = a[i];
		rechargable[i] = r[i];
		ans.pb(1);
		contNode[i] = 0;
	}
	for(int i = 0 ; i < m ; i ++){
		adj[u[i]].pb(v[i]);
		inv[v[i]].pb(u[i]);
	}
	do{
		restart();
		getA();
		restart2();
		getB();
		bool quedo = false;
		//cout << "Fb(x) = ";
		for(int i = 0 ; i < n ; i ++){
			if(!answered[i] and isFB[i]){
				//cout << i << " " ;
				answered[i] = true;
				quedo = true;
				ans[i] = 0;
			}
		}
		//cout << endl;
		if(!quedo)return ans;
	}while(true);

}

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

train.cpp: In function 'void getA()':
train.cpp:46:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |   for(int i = 0 ; i < inv[cur].size() ; i ++){
      |                   ~~^~~~~~~~~~~~~~~~~
train.cpp:49:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |    if(owner[v] or contNode[v] + 1 == adj[v].size()){
      |                   ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
train.cpp: In function 'void getB()':
train.cpp:72:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |   for(int i = 0 ; i < inv[cur].size() ; i ++){
      |                   ~~^~~~~~~~~~~~~~~~~
train.cpp:75:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |    if(!owner[v] or contNode[v] + 1 == adj[v].size()){
      |                    ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~

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