This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "doll.h"
using namespace std;
struct trigger{
int t = 0;
};
struct sw{
int id, x, y;
};
const int MAXM = 1e5;
const int MAXN = 1e6;
bool p = true;
int n, m;
int h[MAXM + 1];
vector<int> c, x, y, a, t;
unordered_set <int> el;
vector<sw> s;
void create_circuit(int M, std::vector<int> A) {
m = M, n = A.size(); a = A;
t = vector<int> (m + 1, 0);
//Hashing
for(int i = 0; i < n; i++) {
h[a[i]]++;
el.insert(a[i]);
}
t[0] = a[0];
for(int i = 0; i < n - 1; i++){
if(h[a[i]] == 1) t[a[i]] = a[i + 1];
else p = false;
}
if(p) {
answer(t, x, y);
return;
}
//Creating Switch contraptions
// for(int i : el){
// if(h[i] > 1) swsys(i);
// }
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |