제출 #1265714

#제출 시각아이디문제언어결과실행 시간메모리
1265714scalifrastico_098Boxes with souvenirs (IOI15_boxes)C++20
10 / 100
0 ms328 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; long long delivery(int n, int k, int l, int p[]) { long long m=0; int y=l, u=INT_MAX; vector<int> a; a.reserve(n); set<int> s; int t=0; for(int i=0;i<n; i++){int uo=s.size();s.insert(p[i]); if(s.size()!=uo){t++; a.push_back(p[i]);}} sort(a.begin(), a.end()); a.push_back(0); a.push_back(l+1); t+=2; if(t==1){y=t*2;} for(int i=0; i<t; i++) { y=min(2*(l-(a[i]-a[i+1])), y); } for(long long i=0; i<n; i++) { m+=2*(min(p[i], l-p[i])); } if(k==1) return m; return y; }
#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...