oj.uz

답안 #580911

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
580911 2022-06-22T06:00:01 Z Koosha_mv 장난감 기차 (IOI17_train) C++14
11 / 100
 798 ms 1312 KB 
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
//#include "train.h"

const int N=5050;

int n,A[N],B[N],dp[N],pd[N];
vector<int> g[N];

void solve(){
	f(i,0,n) dp[i]=B[i]^1;
	f(t,0,n){
		f(u,0,n){
			int And=1,Or=0;
			for(auto v : g[u]){
				Or|=dp[v];
				And&=dp[v];
			}
			pd[u]=(dp[u] && ((A[u]==0 && Or) || (A[u]==1 && And)));
		}
		f(u,0,n) dp[u]=pd[u];
	}
	//dbga(dp,0,n);
}
vector<int> who_wins(vector<int> a,vector<int> r,vector<int> u,vector<int> v){
	f(i,0,u.size()) g[u[i]].pb(v[i]);
	n=a.size();
	f(i,0,n) A[i]=a[i],B[i]=r[i];
	solve();
	f(i,0,n) A[i]^=1,B[i]=dp[i];
	solve();
	vector<int> ans(n);
	f(i,0,n) ans[i]=dp[i];
	return ans;
}

/*
int32_t main(){
	ios:: sync_with_stdio(0), cin.tie(0), cout.tie(0);
	who_wins({0,1},{1,0},{0,0,1,1},{0,1,0,1});
}*/

Compilation message

train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:8:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define f(i,a,b) for(int i=a;i<b;i++)
......
   45 |  f(i,0,u.size()) g[u[i]].pb(v[i]);
      |    ~~~~~~~~~~~~                
train.cpp:45:2: note: in expansion of macro 'f'
   45 |  f(i,0,u.size()) g[u[i]].pb(v[i]);
      |  ^

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 276 ms 900 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Incorrect 1 ms 340 KB 3rd lines differ - on the 4th token, expected: '0', found: '1'
5 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 440 ms 1312 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 524 ms 1124 KB Output is correct
2 Correct 686 ms 1196 KB Output is correct
3 Correct 652 ms 1292 KB Output is correct
4 Correct 608 ms 1284 KB Output is correct
5 Correct 703 ms 1280 KB Output is correct
6 Correct 724 ms 1264 KB Output is correct
7 Correct 749 ms 1264 KB Output is correct
8 Correct 661 ms 1240 KB Output is correct
9 Correct 649 ms 1204 KB Output is correct
10 Correct 650 ms 1296 KB Output is correct
11 Correct 704 ms 1300 KB Output is correct
12 Correct 624 ms 1292 KB Output is correct
13 Correct 701 ms 1300 KB Output is correct
14 Correct 712 ms 1216 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 798 ms 1296 KB Output is correct
2 Correct 648 ms 1300 KB Output is correct
3 Correct 735 ms 1300 KB Output is correct
4 Correct 600 ms 1204 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 259 ms 896 KB Output is correct
7 Correct 40 ms 952 KB Output is correct
8 Incorrect 28 ms 980 KB 3rd lines differ - on the 5th token, expected: '0', found: '1'
9 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 276 ms 900 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -