제출 #617584

#제출 시각아이디문제언어결과실행 시간메모리
617584AbdelmagedNour고대 책들 (IOI17_books)C++17
22 / 100
2068 ms116708 KiB
#include<bits/stdc++.h> using namespace std; #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>st1; tree<int,null_type,greater<int>,rb_tree_tag,tree_order_statistics_node_update>st2; #include "books.h" //#include"grader.cpp" long long minimum_walk(vector<int> p, int s) { st1.clear(); st2.clear(); int n=p.size(); vector<int>seg1(n),seg2(n); long long res=0,mx=0; for(int i=0;i<n;i++){ st2.insert(p[i]); seg1[i]=st2.order_of_key(i); } for(int i=n-1;i>=1;i--){ st1.insert(p[i]); seg2[i-1]=st1.order_of_key(i); } for(int i=0;i<n-1;i++){ if(seg1[i]==0&&*max_element(seg1.begin()+i,seg1.end()))res+=2; else res+=seg1[i]+seg2[i]; } return res; }

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

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:16:21: warning: unused variable 'mx' [-Wunused-variable]
   16 |     long long res=0,mx=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...
#Verdict Execution timeMemoryGrader output
Fetching results...