oj.uz

Submission #337415

# Submission time Handle Problem Language Result Execution time Memory
337415 2020-12-20T15:51:04 Z ryangohca Naan (JOI19_naan) C++17
24 / 100
 2 ms 492 KB 
#include <bits/stdc++.h>
#define int long long
#define pii pair<int, int>
using namespace std;
 
int nums[2000][2000];
pii cuts[2000][2000];
vector<pii> confirmed;
vector<int> order;
bool ordered[2000];
inline int read() {
    int g; cin >> g;
    return g;
}
main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n = read(), l = read();
    for (int i = 0; i < n; i++){
        int need = 0;
        for (int j = 0; j < l; j++){
            cin >> nums[i][j]; nums[i][j] *= n;
            need += nums[i][j];
        }
        need /= n;
        cuts[i][0] = {0, 0};
        int idxwhole = 0, idxpart = 0;
        int curr = 0;
        for (int j = 1; j < n; j++){
            while (need > curr){
                int willtake = nums[i][idxwhole] - idxpart;
                if (curr + willtake <= need){
                    curr += willtake;
                    idxwhole++;
                    idxpart = 0;
                } else {
                    idxpart += need - curr;
                    curr = need;
                }
            }
            cuts[i][j] = pii(idxwhole, idxpart);
            curr = 0;
        }
    }
    for (int i = 1; i < n; i++){
        auto take = pair<pii, int>({INT_MAX, INT_MAX}, -1);
        for (int j = 0; j < n; j++){
            if (ordered[j]) continue;
            pii curr = cuts[j][i];
            if (curr.first > take.first.first) continue;
            else if (curr.first == take.first.first){
                if (curr.second > take.first.second) continue;
            }
            take = {curr, j};
        }
        ordered[take.second] = true;
        confirmed.push_back({take.first.first*nums[take.second][take.first.first]+take.first.second, nums[take.second][take.first.first]});
        order.push_back(take.second);
    }
    for (int i = 0; i < n; i++){
        if (!ordered[i]) order.push_back(i);
    }
    for (auto [a, b] : confirmed){
        int f = __gcd(a, b);
        cout << a/f << ' ' << b/f << '\n';
    }
    for (auto i : order) cout << i + 1 << ' ';
    cout << endl;
}

Compilation message

naan.cpp:15:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   15 | main(){
      |      ^

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Incorrect 1 ms 364 KB Not a fair distribution.
9 Halted 0 ms 0 KB -

Subtask #2
24.0 / 24.0

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

Subtask #3
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Incorrect 1 ms 364 KB Not a fair distribution.
9 Halted 0 ms 0 KB -