oj.uz

Submission #485091

# Submission time Handle Problem Language Result Execution time Memory
485091 2021-11-06T07:22:09 Z nhanbin03 Watermelon (INOI20_watermelon) C++14
49 / 100
 121 ms 19292 KB 
#include <bits/stdc++.h>
#define task "INOI20_watermelon"
#define X first
#define Y second
#define left ___left
#define right ___right

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int N = 1e5 + 10;

int n, k;
int a[N], inDeg[N], ans[N], rev[N];
vector<int> adj[N], pos[N];

bool buildDAG(int maxVal) {
    for (int i = 1; i <= n; i++) {
        pos[a[i]].push_back(i);
    }
    set<int> posSet;
    for (int i = maxVal; i >= 1; i--) {
        if (pos[i].empty()) return 0;
        for (int j = pos[i].size() - 1; j >= 0; j--)  {
            int x = pos[i][j];
            auto it = posSet.lower_bound(x);
            if (it != posSet.end()) {
                adj[x].push_back(*it);
                inDeg[*it]++;
            }
            if (it != posSet.begin()) {
                it--;
                if (j == 0 || pos[i][j - 1] < *it) {
                    adj[x].push_back(*it);
                    inDeg[*it]++;
                }
            }
            posSet.insert(x);
        }
    }
    return 1;
}

void solve() {
    priority_queue<int, vector<int>, greater<int>> pq;
    for (int i = 1; i <= n; i++) {
        if (inDeg[i] == 0) {
            pq.push(i);
        }
    }
    for (int i = 1; i <= n; i++) {
        int u = pq.top(); pq.pop();
        ans[u] = i;
        for (int v : adj[u]) {
            inDeg[v]--;
            if (inDeg[v] == 0) pq.push(v);
        }
    }
    for (int i = 1; i <= n; i++) {
        assert(inDeg[i] == 0);
        rev[ans[i]] = i;
    }
}

bool check() {
    vector<int> left(n + 1), right(n + 1), tmp(n + 1, -1);
    set<int> cur;
    for (int i = 1; i < n; i++) {
        left[i + 1] = i;
        right[i] = i + 1;
        if (ans[i] < ans[i + 1]) cur.insert(i);
    }
    int cnt = 0;
    while (cur.size()) {
        cnt++;
        set<int> nxt;
        for (auto it = cur.begin(); it != cur.end(); it++) {
            int x = *it;
//            cout << x << endl;
            tmp[x] = cnt;
            right[left[x]] = right[x];
            left[right[x]] = left[x];
            if (left[x] != 0 && ans[left[x]] < ans[right[x]]) nxt.insert(left[x]);
        }
//        cout << endl;
        cur = nxt;
    }
//    for (int i = 1; i <= n; i++) {
//        cout << tmp[i] << " " << a[i] << endl;
//    }cout << endl;
    for (int i = 1; i <= n; i++) {
        if (tmp[i] != -1 && a[i] != tmp[i]) return 0;
    }
    return 1;
}

bool findNext() {
    set<int> s;
    for (int i = n; i >= 1; i--) {
        int u = rev[i];
//        cout << i << " " << u << endl;
        for (int v : adj[u]) {
            inDeg[v]++;
            s.erase(v);
        }
//        for (auto it = s.begin(); it != s.end(); it++) cout << *it << " "; cout << endl;
        auto it = s.lower_bound(u);
        if (it != s.end()) {
            priority_queue<int, vector<int>, greater<int>> pq;
            int u = *it;
            pq.push(u);
            for (int j = i; j <= n; j++) {
                int u = pq.top(); pq.pop();
                if (j == i) {
                    pq.push(rev[i]);
//                    cout << rev[i] << endl;
                    for (auto it = s.begin(); it != s.end(); it++) {
//                        cout << *it << " ";
                        if (*it != u) pq.push(*it);
                    }
//                    cout << endl;
                }
                ans[u] = j;
                for (int v : adj[u]) {
                    inDeg[v]--;
//                    cout << u << " " << v << " " << inDeg[v] << endl;
                    if (inDeg[v] == 0) pq.push(v);
                }
            }
            return 1;
        }
        s.insert(u);
    }
    return 0;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cout.tie(0);
    if (fopen(task ".inp","r")) {
        freopen(task ".inp","r",stdin);
        freopen(task ".out","w",stdout);
    }
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    assert(n != 10 || (a[1] <= 4 && a[2] <= 3));
    if (a[n] != -1) {
        cout << -1;
        return 0;
    }
    int maxVal = 0;
    for (int i = 1; i <= n; i++) {
        maxVal = max(maxVal, a[i]);
    }
    for (int i = n; i >= 1; i--) {
        if (a[i] == -1) a[i] = ++maxVal;
    }
//    for (int i = 1; i <= n; i++) {
//        cout << a[i] << " ";
//    }
//    cout << "\n";
    if (!buildDAG(maxVal)) {
        cout << -1;
        return 0;
    }
//    for (int i = 1; i <= n; i++) {
//        cout << i << ": ";
//        for (int j : adj[i]) {
//            cout << j << " ";
//        }
//        cout << "\n";
//    }
    solve();
    if (!check()) {
        cout << -1;
        return 0;
    }
    for (int i = 1; i < k; i++) {
        if (!findNext()) {
            cout << -1;
            return 0;
        }
        for (int j = 1; j <= n; j++) {
//            cout << ans[j] << " ";
            assert(inDeg[j] == 0);
            rev[ans[j]] = j;
        }
//        cout << endl;
    }
    for (int i = 1; i <= n; i++) {
        cout << ans[i] << " ";
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:144:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  144 |         freopen(task ".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:145:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  145 |         freopen(task ".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 5020 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Runtime error 7 ms 9932 KB Execution killed with signal 6
6 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 5020 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Runtime error 7 ms 9932 KB Execution killed with signal 6
6 Halted 0 ms 0 KB -

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 10712 KB Output is correct
2 Correct 11 ms 6220 KB Output is correct
3 Correct 48 ms 10772 KB Output is correct
4 Correct 9 ms 6220 KB Output is correct
5 Correct 41 ms 10720 KB Output is correct
6 Correct 38 ms 10760 KB Output is correct
7 Correct 37 ms 10692 KB Output is correct
8 Correct 39 ms 10640 KB Output is correct
9 Correct 38 ms 10680 KB Output is correct
10 Correct 44 ms 10752 KB Output is correct
11 Correct 81 ms 16296 KB Output is correct
12 Correct 105 ms 16336 KB Output is correct
13 Correct 82 ms 16272 KB Output is correct
14 Correct 93 ms 16332 KB Output is correct
15 Correct 27 ms 7492 KB Output is correct
16 Correct 18 ms 7544 KB Output is correct
17 Correct 16 ms 7568 KB Output is correct
18 Correct 17 ms 7608 KB Output is correct
19 Correct 16 ms 7628 KB Output is correct
20 Correct 16 ms 7548 KB Output is correct
21 Correct 19 ms 7628 KB Output is correct
22 Correct 16 ms 7552 KB Output is correct
23 Correct 21 ms 7552 KB Output is correct
24 Correct 88 ms 17188 KB Output is correct
25 Correct 75 ms 17228 KB Output is correct
26 Correct 77 ms 17348 KB Output is correct
27 Correct 72 ms 16960 KB Output is correct
28 Correct 68 ms 17024 KB Output is correct
29 Correct 74 ms 16968 KB Output is correct
30 Correct 28 ms 8472 KB Output is correct
31 Correct 48 ms 10784 KB Output is correct
32 Correct 94 ms 15264 KB Output is correct
33 Correct 92 ms 16508 KB Output is correct
34 Correct 8 ms 6316 KB Output is correct
35 Correct 16 ms 7264 KB Output is correct
36 Correct 41 ms 10736 KB Output is correct
37 Correct 116 ms 16456 KB Output is correct
38 Correct 81 ms 16640 KB Output is correct
39 Correct 88 ms 16540 KB Output is correct
40 Correct 63 ms 17788 KB Output is correct
41 Correct 70 ms 19232 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 10712 KB Output is correct
2 Correct 11 ms 6220 KB Output is correct
3 Correct 48 ms 10772 KB Output is correct
4 Correct 9 ms 6220 KB Output is correct
5 Correct 41 ms 10720 KB Output is correct
6 Correct 38 ms 10760 KB Output is correct
7 Correct 37 ms 10692 KB Output is correct
8 Correct 39 ms 10640 KB Output is correct
9 Correct 38 ms 10680 KB Output is correct
10 Correct 44 ms 10752 KB Output is correct
11 Correct 81 ms 16296 KB Output is correct
12 Correct 105 ms 16336 KB Output is correct
13 Correct 82 ms 16272 KB Output is correct
14 Correct 93 ms 16332 KB Output is correct
15 Correct 27 ms 7492 KB Output is correct
16 Correct 18 ms 7544 KB Output is correct
17 Correct 16 ms 7568 KB Output is correct
18 Correct 17 ms 7608 KB Output is correct
19 Correct 16 ms 7628 KB Output is correct
20 Correct 16 ms 7548 KB Output is correct
21 Correct 19 ms 7628 KB Output is correct
22 Correct 16 ms 7552 KB Output is correct
23 Correct 21 ms 7552 KB Output is correct
24 Correct 88 ms 17188 KB Output is correct
25 Correct 75 ms 17228 KB Output is correct
26 Correct 77 ms 17348 KB Output is correct
27 Correct 72 ms 16960 KB Output is correct
28 Correct 68 ms 17024 KB Output is correct
29 Correct 74 ms 16968 KB Output is correct
30 Correct 28 ms 8472 KB Output is correct
31 Correct 48 ms 10784 KB Output is correct
32 Correct 94 ms 15264 KB Output is correct
33 Correct 92 ms 16508 KB Output is correct
34 Correct 8 ms 6316 KB Output is correct
35 Correct 16 ms 7264 KB Output is correct
36 Correct 41 ms 10736 KB Output is correct
37 Correct 116 ms 16456 KB Output is correct
38 Correct 81 ms 16640 KB Output is correct
39 Correct 88 ms 16540 KB Output is correct
40 Correct 63 ms 17788 KB Output is correct
41 Correct 70 ms 19232 KB Output is correct
42 Correct 56 ms 10752 KB Output is correct
43 Correct 13 ms 6312 KB Output is correct
44 Correct 39 ms 10736 KB Output is correct
45 Correct 9 ms 6220 KB Output is correct
46 Correct 9 ms 6220 KB Output is correct
47 Correct 10 ms 6256 KB Output is correct
48 Correct 9 ms 6220 KB Output is correct
49 Correct 43 ms 10784 KB Output is correct
50 Correct 57 ms 10752 KB Output is correct
51 Correct 54 ms 10752 KB Output is correct
52 Correct 83 ms 16288 KB Output is correct
53 Correct 86 ms 16324 KB Output is correct
54 Correct 23 ms 7628 KB Output is correct
55 Correct 17 ms 7504 KB Output is correct
56 Correct 86 ms 15320 KB Output is correct
57 Correct 112 ms 16460 KB Output is correct
58 Correct 95 ms 16452 KB Output is correct
59 Correct 96 ms 16560 KB Output is correct
60 Correct 121 ms 16588 KB Output is correct
61 Correct 75 ms 17788 KB Output is correct
62 Correct 65 ms 19292 KB Output is correct
63 Correct 77 ms 16980 KB Output is correct
64 Correct 70 ms 17444 KB Output is correct

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 5020 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Runtime error 7 ms 9932 KB Execution killed with signal 6
6 Halted 0 ms 0 KB -