oj.uz

Submission #794209

# Submission time Handle Problem Language Result Execution time Memory
794209 2023-07-26T10:48:16 Z alvingogo Toy Train (IOI17_train) C++14
11 / 100
 1983 ms 896 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]=100000*inf;
		}
		else{
			it[i]=-100000*inf;
		}
	}
	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){
			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]=-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);
			}
		}
		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);
			}
		}
		print(dz);
		for(int j=0;j<n;j++){
			dz[j]=min(dz[j],dis[j]);
		}
		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 Incorrect 447 ms 676 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB 3rd lines differ - on the 4th token, expected: '0', found: '1'
5 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 612 ms 884 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 606 ms 800 KB Output is correct
2 Correct 688 ms 852 KB Output is correct
3 Correct 733 ms 880 KB Output is correct
4 Correct 808 ms 896 KB Output is correct
5 Correct 834 ms 872 KB Output is correct
6 Correct 796 ms 864 KB Output is correct
7 Correct 863 ms 872 KB Output is correct
8 Correct 661 ms 856 KB Output is correct
9 Correct 693 ms 852 KB Output is correct
10 Correct 741 ms 876 KB Output is correct
11 Correct 706 ms 880 KB Output is correct
12 Correct 780 ms 888 KB Output is correct
13 Correct 935 ms 884 KB Output is correct
14 Correct 763 ms 852 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1487 ms 880 KB Output is correct
2 Correct 836 ms 884 KB Output is correct
3 Correct 1983 ms 876 KB Output is correct
4 Correct 1432 ms 852 KB Output is correct
5 Correct 2 ms 212 KB Output is correct
6 Correct 305 ms 672 KB Output is correct
7 Correct 135 ms 624 KB Output is correct
8 Incorrect 167 ms 596 KB 3rd lines differ - on the 5th token, expected: '0', found: '1'
9 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# Verdict Execution time Memory Grader output
1 Incorrect 447 ms 676 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -