Submission #1353855

#	Time	Username	Problem	Language	Result	Execution time	Memory
1353855		mariza	Theseus (CEOI25_theseus)	C++20	12 / 100	2084 ms	5612 KiB

theseus

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll N=1e4;

vector<int> paint(int n, vector<pair<int,int>> e, int t){
    t--;
    vector<ll> g[n];
    for(auto i:e){
        ll u, v;
        tie(u,v)=i; u--; v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    ll d[n]={};
    bool x[n];
    ll u=g[t][0], v=g[t][1];
    d[u]=1; d[v]=1;
    x[u]=0; x[v]=1;
    while(g[u].size()>2){
        // cout<<u<<" "<<v<<endl;
        ll nxt_u;
        for(auto nxt:g[u]){
            if(nxt!=t && d[nxt]==0) nxt_u=nxt;
        }
        ll nxt_v;
        for(auto nxt:g[v]){
            if(nxt!=t && d[nxt]==0) nxt_v=nxt;
        }

        d[nxt_u]=d[u]+1;
        d[nxt_v]=d[v]+1;
        x[nxt_u]=0;
        x[nxt_v]=1;

        u=nxt_u;
        v=nxt_v;
        // cout<<u<<" "<<v<<endl;
    }

    vector<int> ans;
    for(auto i:e){
        ll u, v;
        tie(u,v)=i; u--; v--;
        
        if((d[v]<d[u]) || ((d[v]==d[u]) && x[u]==0)){  // u -> v
            if(u<v) ans.push_back(1);
            else ans.push_back(0);
        }
        else{  // v -> u
            if(u>v) ans.push_back(1);
            else ans.push_back(0);
        }
    }
    return ans;
}

int travel(int n, int u, vector<pair<int,int>> nxt) {
    for(auto i:nxt){
        if((i.second==1 && i.first>u) || (i.second==0 && i.first<u)) return i.first;
    }
}

Compilation message (stderr)

theseus.cpp: In function 'int travel(int, int, std::vector<std::pair<int, int> >)':
theseus.cpp:64:1: warning: control reaches end of non-void function [-Wreturn-type]
   64 | }
      | ^

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