Submission #707784

#TimeUsernameProblemLanguageResultExecution timeMemory
707784victor_gaoMinerals (JOI19_minerals)C++17
80 / 100
36 ms2712 KiB
#include"minerals.h" #include<bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); vector<int>arr; bool alive[100015]; int n; void Merge(int l,int r,vector<int>have,bool stay1,bool stay2){ if (l==r){ Answer(arr[l-1],have[0]); return; } int mid=(l+r)>>1,last; vector<int>L,R; if (!stay1){ for (int i=l-1;i<mid;i++){ last=Query(arr[i]); alive[arr[i]]^=1; } } else { for (int i=mid;i<r;i++){ last=Query(arr[i]); alive[arr[i]]^=1; } } for (auto i:have){ int now=Query(i); alive[i]^=1; bool ty=(now==last); if (ty) L.push_back(i); else R.push_back(i); last=now; } Merge(mid+1,r,R,0,stay2^1); Merge(l,mid,L,1,stay2^1); } void Solve(int N){ n=N; vector<int>qry; int last=-1; for (int i=1;i<=2*N;i++){ int now=Query(i); if (now==last){ qry.push_back(i); } else { arr.push_back(i); last=now; } alive[i]=1; } //for (auto i:arr) cout<<i<<" "; //cout<<'\n'; //for (auto i:qry) cout<<i<<" "; //cout<<'\n'; Merge(1,N,qry,1,1); } /* g++ -std=gnu++14 -O2 -o grader grader.cpp minerals.cpp ./grader.exe 4 1 5 2 6 3 4 7 8 */

Compilation message (stderr)

minerals.cpp: In function 'void Merge(int, int, std::vector<int>, bool, bool)':
minerals.cpp:31:9: warning: 'last' may be used uninitialized in this function [-Wmaybe-uninitialized]
   31 |         if (ty)
      |         ^~
#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...