Submission #1040730

#TimeUsernameProblemLanguageResultExecution timeMemory
1040730YassineBenYounesThe Collection Game (BOI21_swaps)C++17
0 / 100
0 ms344 KiB
#include<bits/stdc++.h> //#include<chrono> //#include<random> #include "swaps.h" typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef double db; ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD) ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM) int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1}; int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1}; #define endl "\n" #define ss second #define ff first #define all(x) (x).begin() , (x).end() #define pb push_back #define vi vector<int> #define vii vector<pair<int,int>> #define vl vector<ll> #define vll vector<pair<ll,ll>> #define pii pair<int,int> #define pll pair<ll,ll> #define pdd pair<double,double> #define vdd vector<pdd> #define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #define pbds tree<pii, null_type, less<pii>,rb_tree_tag, tree_order_statistics_node_update> using namespace __gnu_pbds; using namespace std; //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); ////////////////////Only Clear Code////////////////////////// void usaco_problem(){ freopen("milkvisits.in", "r", stdin); freopen("milkvisits.out", "w", stdout); } void init(){ #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif // ONLINE_JUDGE } const int mx = 2e5+5; const int LOG = 22; const int inf = 1e9; const ll mod = 1e9+7; const int sq = 320; int n; /* vi cur; void schedule(int i, int j){ cur.pb(0); } vi visit(){ vi v = cur; cur.clear(); return v; } */ vi recur(vi v){ if(v.size() == 1)return v; int md = v.size()/2; vi a, b; for(int i = 0; i < v.size();i++){ if(i < md){ a.pb(v[i]); } else{ b.pb(v[i]); } } recur(a); recur(b); /*cout << v.size() << endl; for(int x : a){ cout << x << " "; } cout << endl; for(int x : b){ cout << x << " "; } cout << endl;*/ for(int i = 0; i < a.size();i++){ for(int j = 0;j < b.size();j++){ schedule(a[i], b[j]); } } vi res = visit(); int x = 0, y = 0; vi ans; while(x < a.size() && y < b.size()){ int k = res[x * b.size() + y]; if(k == 1){ ans.pb(a[x]); x++; } else{ ans.pb(b[y]); y++; } } while(x < a.size()){ ans.pb(a[x]); x++; } while(y < b.size()){ ans.pb(b[y]); y++; } return ans; } void solve(int N, int v){ n = N; vi x; for(int i = 1; i <= n;i++){ x.pb(i); } vi a = recur(x); /*for(int x : a){ cout << x << " "; } cout << endl;*/ answer(a); } /* int32_t main(){ init(); speed; solve(10, 100); }*/ /* NEVER GIVE UP! DOING SMTHNG IS BETTER THAN DOING NTHNG!!! Your Guide when stuck: - Continue keyword only after reading the whole input - Don't use memset with testcases - Check for corner cases(n=1, n=0) - Check where you declare n(Be careful of declaring it globally and in main) */

Compilation message (stderr)

swaps.cpp: In function 'std::vector<int> recur(std::vector<int>)':
swaps.cpp:72:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |     for(int i = 0; i < v.size();i++){
      |                    ~~^~~~~~~~~~
swaps.cpp:91:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |     for(int i = 0; i < a.size();i++){
      |                    ~~^~~~~~~~~~
swaps.cpp:92:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |         for(int j = 0;j < b.size();j++){
      |                       ~~^~~~~~~~~~
swaps.cpp:99:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |     while(x < a.size() && y < b.size()){
      |           ~~^~~~~~~~~~
swaps.cpp:99:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |     while(x < a.size() && y < b.size()){
      |                           ~~^~~~~~~~~~
swaps.cpp:110:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |     while(x < a.size()){
      |           ~~^~~~~~~~~~
swaps.cpp:114:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |     while(y < b.size()){
      |           ~~^~~~~~~~~~
swaps.cpp: In function 'void usaco_problem()':
swaps.cpp:37:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     freopen("milkvisits.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
swaps.cpp:38:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |     freopen("milkvisits.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
swaps.cpp: In function 'void init()':
swaps.cpp:44:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 | freopen("input.txt", "r", stdin);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
swaps.cpp:46:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 | freopen("output.txt", "w", stdout);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
#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...