#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 time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
21 ms |
2884 KB |
Output is correct |
3 |
Correct |
17 ms |
2092 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
13 ms |
1604 KB |
Output is correct |
6 |
Correct |
26 ms |
3124 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
21 ms |
2884 KB |
Output is correct |
3 |
Correct |
17 ms |
2092 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
13 ms |
1604 KB |
Output is correct |
6 |
Correct |
26 ms |
3124 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Incorrect |
26 ms |
2608 KB |
wrong motion |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
21 ms |
2884 KB |
Output is correct |
3 |
Correct |
17 ms |
2092 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
13 ms |
1604 KB |
Output is correct |
6 |
Correct |
26 ms |
3124 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Incorrect |
26 ms |
2608 KB |
wrong motion |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
wrong motion |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
wrong motion |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
wrong motion |
2 |
Halted |
0 ms |
0 KB |
- |