Submission #416094

#TimeUsernameProblemLanguageResultExecution timeMemory
416094duality버섯 세기 (IOI20_mushrooms)C++14
91.87 / 100
15 ms372 KiB
#define DEBUG 0 #include <bits/stdc++.h> using namespace std; #if DEBUG // basic debugging macros int __i__,__j__; #define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl #define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl #define printVar(n) cout<<#n<<": "<<n<<endl #define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl #define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;} #define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;} // advanced debugging class // debug 1,2,'A',"test"; class _Debug { public: template<typename T> _Debug& operator,(T val) { cout << val << endl; return *this; } }; #define debug _Debug(), #else #define printLine(l) #define printLine2(l,c) #define printVar(n) #define printArr(a,l) #define print2dArr(a,r,c) #define print2dArr2(a,r,c,l) #define debug #endif // define #define MAX_VAL 999999999 #define MAX_VAL_2 999999999999999999LL #define EPS 1e-6 #define mp make_pair #define pb push_back // typedef typedef unsigned int UI; typedef long long int LLI; typedef unsigned long long int ULLI; typedef unsigned short int US; typedef pair<int,int> pii; typedef pair<LLI,LLI> plli; typedef vector<int> vi; typedef vector<LLI> vlli; typedef vector<pii> vpii; typedef vector<plli> vplli; // ---------- END OF TEMPLATE ---------- #include "mushrooms.h" int count_mushrooms(int n) { int i,j,ans = 0; vi a,b,v; a.pb(0); for (i = 1; i < n; i++) { v.pb(i); if ((max(a.size(),b.size()) >= 2) && (max(a.size(),b.size()) < 100) && (v.size() == 2)) { if (a.size() >= 2) { int r = use_machine({v[0],a[0],v[1],a[1]}); if (r & 1) b.pb(v[0]); else a.pb(v[0]); if (r & 2) b.pb(v[1]); else a.pb(v[1]); } else { int r = use_machine({v[0],b[0],v[1],b[1]}); if (r & 1) a.pb(v[0]); else b.pb(v[0]); if (r & 2) a.pb(v[1]); else b.pb(v[1]); } v.clear(); } else if (v.size() == max(a.size(),b.size())) { if (a.size() > b.size()) { vi q; for (j = 0; j < v.size(); j++) q.pb(v[j]),q.pb(a[j]); int r = use_machine(q); ans += v.size()-r/2-1; if (r & 1) b.pb(v[0]); else a.pb(v[0]); } else { vi q; for (j = 0; j < v.size(); j++) q.pb(v[j]),q.pb(b[j]); int r = use_machine(q); ans += r/2; if (r & 1) a.pb(v[0]); else b.pb(v[0]); } v.clear(); } } if (!v.empty()) { if (a.size() > b.size()) { vi q; for (j = 0; j < v.size(); j++) q.pb(v[j]),q.pb(a[j]); int r = use_machine(q); ans += v.size()-r/2-1; if (r & 1) b.pb(v[0]); else a.pb(v[0]); } else { vi q; for (j = 0; j < v.size(); j++) q.pb(v[j]),q.pb(b[j]); int r = use_machine(q); ans += r/2; if (r & 1) a.pb(v[0]); else b.pb(v[0]); } v.clear(); } return a.size()+ans; }

Compilation message (stderr)

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:85:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |                 for (j = 0; j < v.size(); j++) q.pb(v[j]),q.pb(a[j]);
      |                             ~~^~~~~~~~~~
mushrooms.cpp:93:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |                 for (j = 0; j < v.size(); j++) q.pb(v[j]),q.pb(b[j]);
      |                             ~~^~~~~~~~~~
mushrooms.cpp:105:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |             for (j = 0; j < v.size(); j++) q.pb(v[j]),q.pb(a[j]);
      |                         ~~^~~~~~~~~~
mushrooms.cpp:113:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |             for (j = 0; j < v.size(); j++) q.pb(v[j]),q.pb(b[j]);
      |                         ~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...