제출 #794171

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
794171		alvingogo	장난감 기차 (IOI17_train)	C++14	0 / 100	609 ms	880 KiB

train

#include "train.h"
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;

typedef long long ll;
const ll inf=1e9;
void print(auto a){
	return;
	for(auto h:a){
		cerr << h << " ";
	}
	cerr << "\n";
}
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
	int n=a.size(),m=u.size();
	vector<int> ans(n);
	vector<ll> dis(n),val(n);
	vector<ll> it(n);
	for(int i=0;i<n;i++){
		if(r[i]==0){
			val[i]=-1;
		}
		else{
			val[i]=inf;
		}
	}
	for(int i=0;i<n;i++){
		if(a[i]==0){
			it[i]=100000*inf;
		}
		else{
			it[i]=-100000*inf;
		}
	}
	for(int i=0;i<n;i++){
		auto dz=it;
		for(int j=0;j<m;j++){
			ll p=dis[v[j]]+val[v[j]];
			if(a[u[j]]==1){
				dz[u[j]]=max(dz[u[j]],p);
			}
			else{
				dz[u[j]]=min(dz[u[j]],p);
			}
		}
		print(dis);
		dis=dz;
	}
	auto dz=it;
	for(int j=0;j<m;j++){
		ll p=dis[v[j]]+val[v[j]];
		if(a[u[j]]==1){
			dz[u[j]]=max(dz[u[j]],p);
		}
		else{
			dz[u[j]]=min(dz[u[j]],p);
		}
	}
	print(dis);
	print(dz);
	for(int i=0;i<n;i++){
		ans[i]=(dis[i]>=0);
	}
	return ans;
}

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

train.cpp:12:12: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   12 | void print(auto a){
      |            ^~~~

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