# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
131751 | IOrtroiii | Naan (JOI19_naan) | C++14 | 624 ms | 118784 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Val = array<ll, 3>;
bool cmp(Val l, Val r) {
if (l[0] ^ r[0]) {
return l[0] < r[0];
} else {
return l[1] * r[2] < l[2] * r[1];
}
}
int main() {
ios_base::sync_with_stdio(false);
int n, l;
cin >> n >> l;
vector<vector<Val>> go(n);
for (int i = 0; i < n; ++i) {
ll sum = 0;
vector<ll> a(l);
for (int j = 0; j < l; ++j) {
cin >> a[j];
sum += a[j];
}
ll csum = 0;
int cur = 0;
for (int j = 1; j < n; ++j) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |