Submission #474420

#TimeUsernameProblemLanguageResultExecution timeMemory
474420hhhhauraMouse (info1cup19_mouse)C++14
0 / 100
0 ms200 KiB
#define wiwihorz #include "grader.h" #include <bits/stdc++.h> #pragma GCC optimize("Ofast") #pragma loop-opt(on) #define rep(i, a, b) for(int i = a; i <= b; i ++) #define rrep(i, a, b) for(int i = b; i >= a; i--) #define all(x) x.begin(), x.end() #define ceil(a, b) ((a + b - 1) / (b)) using namespace std; #define lld long double #define pii pair<int, int> #define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()) #ifdef wiwihorz #define print(a...) cerr << "Line: " << __LINE__, kout("[" + string(#a) + "] = ", a) void vprint(auto L, auto R) { cerr << *L << " \n"[next(L) == R], ++L; } void kout() { cerr << endl; } template<class T1, class ... T2> void kout(T1 a, T2 ... e) { cerr << a << " ", kout(e...);} #else #define print(...) 0 #define vprint(...) 0 #endif int n, tot; random; vector<int> a; void init_(int _n) { n = _n, tot = 0; // a.assign(n + 1, 0); // rep(i, 1, n) a[i] = i; // shuffle(a.begin() + 1, a.begin() + n + 1, rnd); } /* int query(vector<int> b) { assert(b.size() == n + 1); int cnt = 0; tot ++; rep(i, 1, n) cnt += a[i] == b[i]; return cnt; } */ void solve(int n) { init_(n); vector<int> v(n + 1, 0); rep(i, 1, n) v[i] = i; int cur = query(v), tp; rep(i, 1, n) rep(j, i + 1, n) { if(cur == n) return; swap(v[i], v[j]); if(tp = query(v), tp > cur) cur = tp; else swap(v[i], v[j]); } assert(cur == n); } /*signed main() { ios::sync_with_stdio(false), cin.tie(0); int t; cin >> t; while(t--) { int n; cin >> n; solve(n); print(tot); } return 0; }*/

Compilation message (stderr)

mouse.cpp:5: warning: ignoring '#pragma loop ' [-Wunknown-pragmas]
    5 | #pragma loop-opt(on)
      | 
mouse.cpp:20:13: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   20 | void vprint(auto L, auto R) { cerr << *L << " \n"[next(L) == R], ++L; }
      |             ^~~~
mouse.cpp:20:21: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   20 | void vprint(auto L, auto R) { cerr << *L << " \n"[next(L) == R], ++L; }
      |                     ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...