제출 #757160

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

train

#include<bits/stdc++.h>
#define MAXN 100007
using namespace std;
 
int n,m,curr,res[MAXN];
bool good[MAXN],special[MAXN],pr[MAXN],nxt[MAXN];
vector<int> v[MAXN],ans;

vector<int> who_wins(vector<int> A,vector<int> R, vector<int> from,vector<int> to){
    n=int(A.size()); m=int(from.size());
    
    for(int i=0;i<n;i++){
        if(A[i]==1)good[i]=true;
        if(R[i]==1)special[i]=true;
    }

    for(int i=0;i<m;i++){
        if(from[i]==to[i])pr[from[i]]=true;
        else nxt[i]=true;
    }

    if(special[n-1])curr=1;
    else curr=0;

    for(int i=n-1;i>=0;i--){
        if(pr[i]){
            if(good[i] and special[i])curr=1;
            else if(!good[i] and !special[i])curr=0;
        }
        res[i]=curr;

        if(i>0 and !nxt[i-1]){
            if(special[i-1])curr=1;
            else curr=0;
        }
    }

    for(int i=0;i<n;i++){
        ans.push_back(res[i]);
    }

    return ans;
}

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