oj.uz

Submission #794231

# Submission time Handle Problem Language Result Execution time Memory
794231 2023-07-26T11:09:00 Z alvingogo Toy Train (IOI17_train) C++14
10 / 100
 2000 ms 852 KB 
#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]=2000000*inf;
		}
		else{
			it[i]=-2000000*inf;
		}
	}
	for(int w=0;w<2*n;w++){
		for(int i=0;i<2*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);
				}
			}
			if(i==0 && w==0){
				fill(dis.begin(),dis.end(),inf);
			}
			for(int j=0;j<n;j++){
				dis[j]=min(dis[j],dz[j]);
			}
			print(dis);
		}
		{
			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);
				}
			}
			for(int j=0;j<n;j++){
				dz[j]=min(dz[j],dis[j]);
			}
			for(int i=0;i<n;i++){
				if(dis[i]!=dz[i] || dis[i]<-50000*inf){
					dis[i]=-100000*inf;
				}
				else{
					dis[i]=0;
				}
			}
		}
	}
	for(int i=0;i<n;i++){
		ans[i]=(dis[i]>-50000*inf);
	}
	return ans;
}

Compilation message

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.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2067 ms 596 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 300 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2066 ms 852 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2055 ms 724 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2062 ms 852 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2067 ms 596 KB Time limit exceeded
2 Halted 0 ms 0 KB -