Submission #380517

#	Time	Username	Problem	Language	Result	Execution time	Memory
380517		Haruto810198	Slagalica (COCI19_slagalica2)	C++17	70 / 70	48 ms	10108 KiB

slagalica

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define double long double

#define FOR(i,l,r,d) for(int i=(l);i<=(r);i+=(d))
#define szof(x) ((int)(x).size())

#define vi vector<int>
#define pii pair<int,int>

#define F first
#define S second

#define pb push_back
#define eb emplace_back
#define mkp make_pair

const int INF=2147483647;
const int MOD=1000000007;
const int mod=998244353;
const double eps=1e-12;

int n;
vector<pii> edge[3]; /// <idx,to>
int indeg[3], outdeg[3];

vi res;

/// nodes :
/// 0 : |
/// 1 : <
/// 2 : >

void EulerCircuit(int v){

    while(!edge[v].empty()){ /// for all edges from v :
        pii i = edge[v].back();
        /// remove i
        edge[v].pop_back();
        /// dfs
        EulerCircuit(i.S);
        res.pb(i.F);
    }

}

signed main(){

    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    /// input
    cin>>n;
    FOR(i,1,n,1){

        int type, idx;
        cin>>type>>idx;

        if(type==1) edge[1].eb(idx,2);
        if(type==2) edge[1].eb(idx,1);
        if(type==3) edge[2].eb(idx,2);
        if(type==4) edge[2].eb(idx,1);
        if(type==5) edge[0].eb(idx,2);
        if(type==6) edge[0].eb(idx,1);
        if(type==7) edge[1].eb(idx,0);
        if(type==8) edge[2].eb(idx,0);

    }

    /// check if Euler circuit exists
    FOR(i,0,2,1){
        outdeg[i] = szof(edge[i]);
        for(pii j : edge[i]){
            indeg[j.S]++;
        }
    }

    FOR(i,0,2,1){
        if( indeg[i] != outdeg[i] ){
            cout<<-1<<'\n';
            return 0;
        }
    }

    /// sort edges
    FOR(i,0,2,1){
        sort(edge[i].begin(),edge[i].end());
        reverse(edge[i].begin(),edge[i].end());
    }

    /// find lex. smallest Euler circuit
    EulerCircuit(0);

    /// output
    reverse(res.begin(),res.end());
    for(int i : res){
        cout<<i<<" ";
    }
    cout<<'\n';

    return 0;

}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5