oj.uz

Submission #170121

# Submission time Handle Problem Language Result Execution time Memory
170121 2019-12-24T04:48:48 Z gs18103 Naan (JOI19_naan) C++14
29 / 100
 58 ms 8948 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define em emplace
#define all(v) v.begin(), v.end()

using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const int MAX = 2020;
const int INF = (1 << 30) - 1;
const ll LINF = 1LL << 60;

int n, k;
ll v[MAX][MAX], sum[MAX][MAX], p[MAX];
pll X[MAX];
bool chk[MAX];

bool cal(int j, int m, pii st) {
    return (sum[j][m] - sum[j][st.fi/st.se]) * n * st.se <= sum[j][k] * st.se + (st.fi % st.se) * v[j][st.fi/st.se+1] * n;
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0);

    cin >> n >> k;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= k; j++) {
            cin >> v[i][j];
            sum[i][j] = sum[i][j-1] + v[i][j];
        }
    }

    pll st = make_pair(0, 1);
    for(int i = 1; i <= n; i++) {
        int idx = 0;
        pll mi = make_pair(k, 1);
        for(int j = 1; j <= n; j++) {
            if(chk[j]) continue;
            int lb = 0, ub = k;
            while(lb < ub) {
                int m = (lb + ub + 1) / 2;
                if(cal(j, m, st)) lb = m;
                else ub = m - 1;
            }
            pll temp = make_pair((sum[j][st.fi/st.se] - sum[j][lb]) * n * st.se + (st.fi % st.se) * v[j][st.fi/st.se+1] * n + sum[j][k] * st.se, n * st.se * v[j][lb+1]);
            if(lb == k) {
                if(temp.fi == 0) {
                    temp = make_pair(0, 1);
                }
                else continue;
            }
            temp.fi += temp.se * lb;
            if(mi.fi * temp.se >= temp.fi * mi.se) mi = temp, idx = j;
        }
        //if(idx == 0) return !(cout << -1);
        chk[idx] = true;
        p[i] = idx;
        ll g = __gcd(mi.fi, mi.se);
        mi.fi /= g, mi.se /= g;
        while(mi.fi > 1000000000 && mi.se > 1000000000) {
            mi.fi = (mi.fi + 2) / 2;
            mi.se = mi.se / 2;
        }
        X[i] = mi;
        st = mi;
    }
    for(int i = 1; i < n; i++) {
        cout << X[i].fi << ' ' << X[i].se << endl;
    }
    for(int i = 1; i <= n; i++) {
        cout << p[i] << ' ';
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 4 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 1 ms 376 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 3 ms 504 KB Output is correct
16 Correct 3 ms 504 KB Output is correct
17 Correct 3 ms 504 KB Output is correct
18 Correct 3 ms 504 KB Output is correct
19 Correct 3 ms 504 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 3 ms 504 KB Output is correct
22 Correct 3 ms 504 KB Output is correct
23 Correct 2 ms 380 KB Output is correct
24 Correct 3 ms 504 KB Output is correct
25 Correct 4 ms 504 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 3 ms 508 KB Output is correct

Subtask #3
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 3 ms 504 KB Output is correct
19 Correct 3 ms 504 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 2 ms 504 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 504 KB Output is correct
24 Correct 4 ms 504 KB Output is correct
25 Correct 3 ms 504 KB Output is correct
26 Correct 2 ms 504 KB Output is correct
27 Correct 1 ms 376 KB Output is correct
28 Correct 2 ms 504 KB Output is correct
29 Correct 3 ms 504 KB Output is correct
30 Correct 3 ms 504 KB Output is correct
31 Correct 3 ms 504 KB Output is correct
32 Correct 3 ms 504 KB Output is correct
33 Correct 3 ms 504 KB Output is correct
34 Correct 3 ms 504 KB Output is correct
35 Correct 3 ms 504 KB Output is correct
36 Correct 3 ms 504 KB Output is correct
37 Correct 3 ms 504 KB Output is correct
38 Correct 2 ms 380 KB Output is correct
39 Correct 3 ms 504 KB Output is correct
40 Correct 4 ms 504 KB Output is correct
41 Correct 3 ms 376 KB Output is correct
42 Correct 3 ms 508 KB Output is correct
43 Incorrect 58 ms 8948 KB X_i is not increasing
44 Halted 0 ms 0 KB -