Submission #1198993

#TimeUsernameProblemLanguageResultExecution timeMemory
1198993TroySerBoxes with souvenirs (IOI15_boxes)C++20
0 / 100
0 ms528 KiB
#include "boxes.h"
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

ll delivery(int N, int K, int L, int p[]) {
    ll totSum = 0;
    for (ll i = 0; i < N; i++) {
        totSum += 2 * min(p[i], N - p[i]);
    }
    return totSum;
}
#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...