Submission #1211651

#TimeUsernameProblemLanguageResultExecution timeMemory
1211651sanoUnscrambling a Messy Bug (IOI16_messy)C++20
20 / 100
1 ms328 KiB
#include "messy.h" #include<iostream> #include<vector> #include<queue> #include<deque> #include<string> #include<fstream> #include<algorithm> #include <iomanip> #include<map> #include <set> #include <unordered_map> #include <stack> #include <unordered_set> #include <cmath> #include <cstdint> #include <cassert> #include <bitset> #include <random> #include <chrono> #include <cstring> #define shit short int #define ll long long #define ld long double //#define int ll #define For(i, n) for(int i = 0; i < (int)n; i++) #define ffor(i, a, n) for(int i = (int)a; i < (int)n; i++) #define rfor(i, n) for(int i = (int)n; i >= (int)0; i--) #define rffor(i, a, n) for(int i = (int)n; i >= (int)a; i--) #define vec vector #define ff first #define ss second #define pb push_back #define pii pair<int, int> #define pld pair<ld, ld> #define NEK 2000000000000000 #define mod 1000000007 #define mod2 1000000009 #define rsz resize #define prv 43 #define prv2 47 #define D 8 #define trav(a,x) for (auto& a: x) #define pb push_back #define ub upper_bound #define lb lower_bound #define all(x) (x).begin(), (x).end() #define sig 0.0000001 using namespace std; /* set<string> s; vec<int> pp; void add_element(string x) { string x2; For(i, pp.size()) x2.push_back(x[i]); For(i, pp.size()) { x2[pp[i]] = x[i]; } s.insert(x2); return; } bool check_element(string x) { return (s.find(x) != s.end()); } void compile_set() { return; }*/ vec<int> restore_permutation(int n, int w, int r) { string x; For(i, n) x.push_back('0'); For(i, n) { x[i] = '1'; add_element(x); } compile_set(); For(i, n) x[i] = '0'; vec<int> p(n); For(i, n) { int mame = -1; for (int j = 0; j < (n - 1); j++) { if (x[j] == '1') continue; x[j] = '1'; bool je = check_element(x); if (je) { mame = j; break; } x[j] = '0'; } if (mame == -1) { mame = n - 1; x[mame] = '1'; } p[i] = mame; } return p; } /* signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; pp.resize(n); For(i, n) cin >> pp[i]; vec<int> p = restore_permutation(n, 0, 0); For(i, p.size()) cout << p[i] << " \n"[i == (p.size() - 1)]; return 0; }*/

Compilation message (stderr)

messy.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
messy_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
#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...