# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1142167 | Muhammet | DEL13 (info1cup18_del13) | C++20 | 1095 ms | 61672 KiB |
#include "bits/stdc++.h"
using namespace std;
#define SZ(s) (int)s.size()
vector <int> v;
int n, m;
bool tr = 0;
map <vector <int>, bool> vis;
void f(vector <int> a, vector <int> ans){
if(vis.find(a) != vis.end() or tr) return;
if(SZ(a) == n+2){
v = ans;
tr = true;
return;
}
vis[a] = true;
for(int i = 1; i < SZ(a)-1; i++){
if(a[i-1] != a[i]-1 and a[i+1] != a[i]+1){
for(int x = a[i-1]+1; x < a[i]; x++){
for(int y = a[i]+1; y < a[i+1]; y++){
vector <int> a1;
for(auto j : a){
// cout << j << ' ';
if(j == a[i]) a1.push_back(x);
# | 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... |