Submission #1195745

#TimeUsernameProblemLanguageResultExecution timeMemory
1195745AvianshToy Train (IOI17_train)C++20
5 / 100
5 ms1864 KiB
#include "train.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
    int n = a.size();
    int m = u.size();
    vector<int>ans(n);
    int curr = 0;
    set<int>g[n];
    for(int i = 0;i<m;i++){
        g[u[i]].insert(v[i]);
    }
    for(int i = n-1;i>=0;i--){
        if(g[i].find(i+1)!=g[i].end()){
            //goes ahead
            if(g[i].size()==2){
                //does both
                if(a[i]){
                    //owned by good
                    if(r[i]){
                        //recharging started
                        curr=1;
                    }
                    else{
                        //continue
                    }
                }
                else{
                    //owned by bad
                    if(r[i]){
                        //continue
                    }
                    else{
                        curr=0;
                    }
                }
            }
            else{
                //only goes ahead
                //continue
            }
        }
        else{
            //only loops
            if(r[i])
                curr=1;
            else{
                curr=0;
            }
        }
        ans[i]=curr;
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...