Submission #33540

#TimeUsernameProblemLanguageResultExecution timeMemory
33540top34051고대 책들 (IOI17_books)C++14
0 / 100
0 ms9828 KiB
#include "books.h" #include<bits/stdc++.h> using namespace std; #define pii pair<int,int> #define X first #define Y second const int maxn = 1000005; int n; long long sum[maxn]; long long minimum_walk(vector<int> pos, int s) { int i; long long ans = 0; n = pos.size(); for(i=0;i<n;i++) sum[min(i,pos[i])]++, sum[max(i,pos[i])]--; for(i=0;i<n-1;i++) { sum[i] += sum[i-1]; ans += sum[i]; } return ans; }
#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...