| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 817901 | LucaIlie | Naan (JOI19_naan) | C++17 | 1057 ms | 63336 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;
const int INF = 1e9;
const int MAX_B = 1e6;
const int MAX_N = 2000;
const int MAX_L = 2000;
bool active[MAX_N];
int permutation[MAX_N];
double happiness[MAX_N][MAX_L + 1], sumHappiness[MAX_N][MAX_L + 1];
double happy[MAX_N], timeFrac[MAX_N], timeFractions[MAX_N];
int main() {
int n, l;
cin >> n >> l;
for ( int i = 0; i < n; i++ ) {
happy[i] = 0;
sumHappiness[i][0] = 0;
for ( int j = 1; j <= l; j++ ) {
int aux;
cin >> aux;
happiness[i][j] = aux;
happy[i] += aux;
sumHappiness[i][j] = sumHappiness[i][j - 1] + happiness[i][j];
}
happy[i] /= n;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||