Submission #1172425

#TimeUsernameProblemLanguageResultExecution timeMemory
1172425nicolo_010Machine (IOI24_machine)C++20
0 / 100
0 ms420 KiB
#pragma GCC optimize("Ofast") #include <bits/stdc++.h> #include "machine.h" using namespace std; using ll = long long; using pii = pair<int, int>; #define rep(i, k, n) for (int i = k; i < n; i++) #define print(vec) for (auto x : vec) cout << x << " "; cout << "\n" #define input(vec) for (int i = 0; i < vec.size(); i++) cin >> vec[i] template<typename T> using v = vector<T>; template<typename T> using pq = priority_queue<T, vector<T>, greater<T>>; const int MOD = 1e9+7; v<int> find_permutation(int N) { int n = N; v<int> a(n, 0); rep(i, 0, n) { a[i] = (i << 7); } v<int> aux = use_machine(a); v<pii> tosort(n); rep(i, 0, n) { tosort[i] = {aux[i], i}; } sort(tosort.begin(), tosort.end()); v<int> ans(n); rep(i, 0, n) { ans[tosort[i].second] = i; } return ans; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...