Submission #742483

#TimeUsernameProblemLanguageResultExecution timeMemory
742483penguin133The Collection Game (BOI21_swaps)C++17
0 / 100
1 ms208 KiB
#include <bits/stdc++.h> using namespace std; //#define int long long #include "swaps.h" #define pi pair<int, int> #define pii pair<int, pi> #define fi first #define se second #ifdef _WIN32 #define getchar_unlocked _getchar_nolock #endif mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); int cnt[505], vis[505], stuf[505][505], ans[505]; bool cmp(int a, int b){ return cnt[a] > cnt[b]; } void solve(int N, int V) { for(int i=1;i<=N;i++){ for(int j=1;j<=N-i;j++){ schedule(i, j); auto grr = visit(); } } vector <int> brr; for(int i=1;i<=N;i++)brr.push_back(i); // sort(brr.begin(), brr.end(), cmp); answer(brr); }
#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...
#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...