제출 #1142778

#제출 시각아이디문제언어결과실행 시간메모리
1142778monkey133Bitaro's travel (JOI23_travel)C++20
100 / 100
358 ms4168 KiB
#include<bits/stdc++.h> using namespace std;typedef long long O0;typedef vector<O0>O1; #define O2(a,b) lower_bound(a.begin(),a.end(),b)-a.begin() int main(){ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);O0 O3,O4;cin>>O3;O1 O5(O3);for(O0 O6=0;O6<O3;O6++)cin>>O5[O6];cin>>O4;while(O4--){O0 O7;cin>>O7;O0 O8=O2(O5,O7),O9=O8,OA=0;while(true){if(O9==0){OA+=O5[O3-1]-O7;break;}if(O8==O3){OA+=O7-O5[0];break;}if(O7-O5[O9-1]<=O5[O8]-O7){O0 OB=O2(O5,2*O7-O5[O8]);OA+=O7-O5[OB];O7=O5[OB];O9=OB;}else{O0 OB=O2(O5,2*O7-O5[O9-1]);OA+=O5[OB-1]-O7;O7=O5[OB-1];O8=OB;}}cout<<OA<<"\n";}return 0;}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...