제출 #599107

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
599107		MohamedFaresNebili	자동 인형 (IOI18_doll)	C++14	2 / 100	116 ms	17536 KiB

doll

#include <bits/stdc++.h>
#include "doll.h"
/// #pragma GCC optimize ("Ofast")
/// #pragma GCC target ("avx2")
/// #pragma GCC optimize("unroll-loops")

                using namespace std;

                using ll = long long;
                using ld = long double;
                using ii = pair<ll, ll>;
                using vi = vector<int>;

                #define ff first
                #define ss second
                #define pb push_back
                #define all(x) (x).begin(), (x).end()
                #define lb lower_bound

                const int MOD = 1e9 + 7;

                void create_circuit(int M, vector<int> A) {
                    int N = A.size(); A.push_back(0);
                    vector<int> C(M + 1, -1); N++;
                    set<pair<int, int>> Switches; vector<int> adj[M + 1];
                    pair<int, int> B[200005];
                    for(int l = 0; l < N; l++) {
                        int U = A[l], V = A[(l + 1) % N];
                        adj[U].push_back(V);
                    }
                    map<pair<int, int>, int> Key; int S = 0;
                    for(int l = 0; l <= M; l++) {
                        if(adj[l].size() <= 1) {
                            adj[l].push_back(0);
                            C[l] = adj[l][0];
                            continue;
                        }
                        int U = adj[l][0], V = adj[l][1];
                        if(!Switches.count({U, V})) {
                            Switches.insert({U, V}),
                            Key[{U, V}] = ++S; B[S] = {U, V};
                        }
                        C[l] = -Key[{U, V}];
                    }
                    vector<int> X(S), Y(S);
                    for(int l = 1; l <= S; l++) {
                        X[l - 1] = B[l].ff, Y[l - 1] = B[l].ss;
                    }
                    answer(C, X, Y);
                }

• Subtask 1: 2 / 2
• Subtask 2: 0 / 4
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 18
• Subtask 6: 0 / 56