제출 #1265721

#제출 시각아이디문제언어결과실행 시간메모리
1265721martin_011선물상자 (IOI15_boxes)C++20
10 / 100
0 ms328 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<ll> vll; long long delivery(int n, int k, int l, int p[]) { ll res = l; vll a; set<ll> s; a.push_back(0); a.push_back(l); s.insert(0); s.insert(l); for (int i=0; i<n; i++) { ll t = s.size(); s.insert(p[i]); if (s.size() > t) a.push_back(p[i]); } ll tam = a.size(); sort(a.begin(), a.end()); for (int i=0; i<(tam-1); i++) { res = min(res, 2 * (l - (a[i+1] - a[i]))); } return res; }
#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...