Submission #960787

#TimeUsernameProblemLanguageResultExecution timeMemory
960787ono_de206MalnaRISC (COI21_malnarisc)C++14
40 / 100
1 ms348 KiB
#include<bits/stdc++.h> using namespace std; #define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); #define in insert #define all(x) x.begin(),x.end() #define pb push_back #define eb emplace_back #define ff first #define ss second #define int long long typedef long long ll; typedef vector<int> vi; typedef set<int> si; typedef multiset<int> msi; typedef pair<int, int> pii; typedef vector<pii> vpii; // typedef pair<int, int> P; template<typename T, typename U> ostream & operator << (ostream &out, const pair<T, U> &c) { out << c.first << ' ' << c.second; return out; } template<typename T> ostream & operator << (ostream &out, vector<T> &v) { const int sz = v.size(); for (int i = 0; i < sz; i++) { if (i) out << ' '; out << v[i]; } return out; } template<typename T> istream & operator >> (istream &in, vector<T> &v) { for (T &x : v) in >> x; return in; } template<typename T, typename U> istream & operator >> (istream &in, pair<T, U> &c) { in >> c.first; in >> c.second; return in; } template<typename T> void mxx(T &a, T b){if(b > a) a = b;} template<typename T> void mnn(T &a, T b){if(b < a) a = b;} const int mxn = 2e5 + 10, MXLOG = 22, mod = 1e9 + 7, P = 1181;// D = 1523, N = 2500; const long long inf = 2e18 + 10; void go() { int n; cin >> n; int N = 1; while(N < n) N <<= 1; vector<vector<pair<int, int>>> ans; auto merge = [&](auto &self, int l, int r, int dir, int id) { if(l == r) return id; int m = (l + r) / 2; while(ans.size() <= id) ans.pb(vector<pair<int, int>>()); auto &ops = ans[id]; for(int i = l; i <= m; i++) { int j = m + (i - l) + 1; if(j > n) break; if(dir) ops.eb(i, j); else ops.eb(j, i); } self(self, l, m, dir, id + 1); return self(self, m + 1, r, dir, id + 1); }; auto solve = [&](auto &self, int l, int r, int dir) -> int { if(l == r) return 0; int m = (l + r) / 2; int id = self(self, l, m, 1); assert(id == self(self, m + 1, r, 0)); return merge(merge, l, r, dir, id); }; solve(solve, 1, N, 1); cout << ans.size() << endl; for(auto ops : ans) { for(auto it : ops) { cout << "CMPSWP R" << it.ff << " R" << it.ss << ' '; } cout << endl; } } signed main() { fast; int t = 1; // cin >> t; while(t--) { go(); } return 0; }

Compilation message (stderr)

malnarisc.cpp: In instantiation of 'go()::<lambda(auto:1&, long long int, long long int, long long int, long long int)> [with auto:1 = go()::<lambda(auto:1&, long long int, long long int, long long int, long long int)>]':
malnarisc.cpp:87:36:   required from here
malnarisc.cpp:69:20: warning: comparison of integer expressions of different signedness: 'std::vector<std::vector<std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   69 |   while(ans.size() <= id) ans.pb(vector<pair<int, int>>());
      |         ~~~~~~~~~~~^~~~~
#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...