제출 #294560

#제출 시각아이디문제언어결과실행 시간메모리
294560Dovran자동 인형 (IOI18_doll)C++11
0 / 100
2 ms204 KiB
#include <bits/stdc++.h> #include "doll.h" #define N 200009 #define pii pair <int, int> #define ff first #define ss second #define pb push_back #define ll long long using namespace std; ll n, c[N]; /* void answer(vector<int>M, vector<int>A, vector<int>B){ for(auto i:M) cout<<i<<' '; cout<<'\n'; for(auto i:A) cout<<i<<' '; cout<<'\n'; for(auto i:B) cout<<i<<' '; } */ void create_circuit(int m, vector<int>a){ n=a.size(); vector<int>e, b; ll x=0; for(int i=0; i<n; i++) c[x]=a[i], x=a[i]; c[x]=0; for(int i=0; i<m; i++) if(!c[i]) c[i]=1; for(int i=0; i<=m; i++) e.pb(c[i]); answer(e, b, b); } /* int main(){ int k, l; vector<int>asd; cin>>k>>l; for(int i=0; i<l; i++){ int dsa; cin>>dsa, asd.pb(dsa); } create_circuit(k, asd); }*/
#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...