oj.uz

Submission #97274

# Submission time Handle Problem Language Result Execution time Memory
97274 2019-02-14T17:32:56 Z popovicirobert Permutation Recovery (info1cup17_permutation) C++14
78 / 100
 4000 ms 93056 KB 
#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#define ld long double
// 217
// 44

using namespace std;

const ll MOD = 9999999999999937LL;
const int MAXN = 70000;

inline void mod(ll &x) {
    if(x >= MOD)
        x -= MOD;
}

ll dif[MAXN + 1], aux[MAXN + 1];
string str;

const int B = 300;

unordered_multiset <ll> fr[MAXN];
ll lazy[MAXN];

int main() {
    //ifstream cin("A.in");
    //ofstream cout("A.out");
    int i, j, n;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> n;
    ll last = 0;
    for(i = 0; i < n; i++) {
        cin >> str;
        ll cur = 0;
        for(auto it : str) {
            cur = (1LL * cur * 10 + it - '0') % MOD;
        }
        dif[i] = cur - last + MOD;
        mod(dif[i]);
        last = cur;
    }
    for(i = 0; i < n; i++) {
        fr[i / B].insert(dif[i]);
        aux[i] = dif[i];
    }
    vector <int> sol(n);
    for(int tt = 1; tt <= n; tt++) {
        i = (n - 1) / B;
        while(i >= 0) {
            ll cur = 1 + lazy[i];
            mod(cur);
            if(fr[i].find(cur) != fr[i].end()) {
                break;
            }
            i--;
        }
        int pos = -1;
        for(j = min(n - 1, (i + 1) * B - 1); j >= i * B; j--) {
            if(sol[j]) {
                continue;
            }
            ll cur = aux[j] - lazy[i] + MOD;
            mod(cur);
            if(cur == 1) {
                pos = j;
                break;
            }
        }
        sol[pos] = tt;
        if(fr[i].find(aux[pos]) == fr[i].end()) {
            while(1) {

            }
        }
        fr[i].erase(fr[i].find(aux[pos]));
        for(j = pos + 1; j < min(n, (i + 1) * B); j++) {
            if(sol[j]) {
                continue;
            }
            if(fr[i].find(aux[j]) == fr[i].end()) {
                while(1) {

                }
            }
            fr[i].erase(fr[i].find(aux[j]));
            aux[j] += MOD - dif[pos];
            mod(aux[j]);
            fr[i].insert(aux[j]);
        }
        i++;
        while(i < (n - 1) / B) {
            lazy[i] += dif[pos];
            mod(lazy[i]);
            i++;
        }
        for(j = i * B; j < n; j++) {
            if(sol[j]) {
                continue;
            }
            if(fr[i].find(aux[j]) == fr[i].end()) {
                while(1) {

                }
            }
            fr[i].erase(fr[i].find(aux[j]));
            aux[j] += MOD - dif[pos];
            mod(aux[j]);
            fr[i].insert(aux[j]);
        }
    }
    for(i = 0; i < n; i++) {
        cout << sol[i] << " ";
    }
    //cin.close();
    //cout.close();
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4224 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4224 KB Output is correct
2 Correct 11 ms 4224 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4224 KB Output is correct
2 Correct 11 ms 4224 KB Output is correct
3 Correct 24 ms 4304 KB Output is correct
4 Correct 25 ms 4224 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4224 KB Output is correct
2 Correct 11 ms 4224 KB Output is correct
3 Correct 24 ms 4304 KB Output is correct
4 Correct 25 ms 4224 KB Output is correct
5 Correct 1088 ms 6796 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4224 KB Output is correct
2 Correct 11 ms 4224 KB Output is correct
3 Correct 24 ms 4304 KB Output is correct
4 Correct 25 ms 4224 KB Output is correct
5 Correct 1088 ms 6796 KB Output is correct
6 Correct 2593 ms 8828 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4224 KB Output is correct
2 Correct 11 ms 4224 KB Output is correct
3 Correct 24 ms 4304 KB Output is correct
4 Correct 25 ms 4224 KB Output is correct
5 Correct 1088 ms 6796 KB Output is correct
6 Correct 2593 ms 8828 KB Output is correct
7 Correct 2818 ms 24948 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4224 KB Output is correct
2 Correct 11 ms 4224 KB Output is correct
3 Correct 24 ms 4304 KB Output is correct
4 Correct 25 ms 4224 KB Output is correct
5 Correct 1088 ms 6796 KB Output is correct
6 Correct 2593 ms 8828 KB Output is correct
7 Correct 2818 ms 24948 KB Output is correct
8 Correct 1579 ms 93056 KB Output is correct
9 Execution timed out 4035 ms 84892 KB Time limit exceeded

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4224 KB Output is correct
2 Correct 11 ms 4224 KB Output is correct
3 Correct 24 ms 4304 KB Output is correct
4 Correct 25 ms 4224 KB Output is correct
5 Correct 1088 ms 6796 KB Output is correct
6 Correct 2593 ms 8828 KB Output is correct
7 Correct 2818 ms 24948 KB Output is correct
8 Correct 1579 ms 93056 KB Output is correct
9 Execution timed out 4035 ms 84892 KB Time limit exceeded