제출 #1043837

#제출 시각아이디문제언어결과실행 시간메모리
1043837beaconmcThe Potion of Great Power (CEOI20_potion)C++14
0 / 100
231 ms127444 KiB
#include <bits/stdc++.h> typedef int ll; #define FOR(i,x,y) for(ll i=x; i<y; i++) #define FORNEG(i,x,y) for(ll i=x; i>y; i--) using namespace std; vector<ll> h; vector<ll> a; vector<ll> b; vector<vector<ll>> changes[100001]; vector<set<ll>> lotchange[100001]; void init(int N, int D, int H[]) { FOR(i,0,N) h.push_back(H[i]); } void curseChanges(int U, int A[], int B[]) { vector<set<ll>> tempedges; tempedges.resize(100001); FOR(i,0,U){ if (tempedges[A[i]].find(B[i]) != tempedges[A[i]].end()){ changes[A[i]].push_back({i+1, B[i]}); tempedges[A[i]].erase(B[i]); } else{ changes[A[i]].push_back({i+1, B[i]}); tempedges[A[i]].insert(B[i]); } if (tempedges[B[i]].find(A[i]) != tempedges[B[i]].end()){ changes[B[i]].push_back({i+1, A[i]}); tempedges[B[i]].erase(A[i]); } else{ changes[B[i]].push_back({i+1, A[i]}); tempedges[B[i]].insert(A[i]); } if ((changes[A[i]].size()-1)%50==0){ lotchange[A[i]].push_back(tempedges[A[i]]); } if ((changes[B[i]].size()-1)%50==0){ lotchange[B[i]].push_back(tempedges[B[i]]); } } } int mindiff(set<ll>&a, set<ll>&b){ ll ans = 1000000000; vector<pair<ll,ll>> A,B; for (auto&i : a) A.push_back(make_pair(h[i], (ll)0)); for (auto&i : b) A.push_back(make_pair(h[i], (ll) 1)); sort(A.begin(), A.end()); if (A.size()==0) return ans; FOR(i,0,A.size()-1){ if (A[i].second != A[i+1].second) ans = min(ans, abs(A[i].first-A[i+1].first)); } return ans; } int question(int x, int y, int v) { v--; ll ans = 1000000000; ll pos = upper_bound(changes[x].begin(), changes[x].end(), vector<ll>{v, 1000000000})-changes[x].begin(); set<ll> X = lotchange[x][pos/50]; FOR(i, (pos/50)*50+1, pos+1){ ll temp = changes[x][i][1]; if (X.find(temp) != X.end()) X.erase(temp); else X.insert(temp); } pos = upper_bound(changes[y].begin(), changes[y].end(), vector<ll>{v, 1000000000})-changes[y].begin(); set<ll> Y = lotchange[y][pos/50]; FOR(i, (pos/50)*50+1, pos+1){ ll temp = changes[y][i][1]; if (Y.find(temp) != Y.end()) Y.erase(temp); else Y.insert(temp); } return mindiff(X,Y); }

컴파일 시 표준 에러 (stderr) 메시지

potion.cpp: In function 'int mindiff(std::set<int>&, std::set<int>&)':
potion.cpp:4:33: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define FOR(i,x,y) for(ll i=x; i<y; i++)
......
   66 |     FOR(i,0,A.size()-1){
      |         ~~~~~~~~~~~~~~           
potion.cpp:66:5: note: in expansion of macro 'FOR'
   66 |     FOR(i,0,A.size()-1){
      |     ^~~
potion.cpp: In function 'int question(int, int, int)':
potion.cpp:75:8: warning: unused variable 'ans' [-Wunused-variable]
   75 |     ll ans = 1000000000;
      |        ^~~
#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...