oj.uz

Submission #281949

# Submission time Handle Problem Language Result Execution time Memory
281949 2020-08-23T16:10:42 Z Atill83 Permutation Recovery (info1cup17_permutation) C++17
71 / 100
 3755 ms 235544 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const long long mod = (long long) 1e9+9;
const int MAXN = (int) 7e4+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
int q[MAXN];
const ll bs = 350;
unordered_map<int, int> mp[MAXN];
int Dec[MAXN];
int ans[MAXN];
int del[MAXN];
int pw[100001][10];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
    #endif

    cin>>n;
    pw[0][1] = 1;
    for(int i = 0; i <= 100000; i++){
        pw[i][0] = 0;
        if(i != 0)
        pw[i][1] = 1LL*pw[i - 1][1]*10%mod;
        for(int j = 2; j < 10; j++){
            pw[i][j] = 1LL*pw[i][1]*j%mod;
        }
    }

    for(int i = 0; i < n; i++){
        string s;
        cin>>s;
        int cnt = s.length() - 1;
        for(char c: s){
            int cur = c - '0';
            del[i] += pw[cnt][cur];
            if(del[i] >= mod) del[i] -= mod; 
            cnt--;
        }
    }
    int bc = (n + bs - 1) / bs;
    for(int i = 0; i < bc; i++){
        for(int j = i*bs; j < min(n, (i + 1)*bs); j++){
            q[j] = del[j] - (j == 0 ? 0 : del[j - 1]);
            if(q[j] < 0) q[j] += mod;
            mp[i][q[j]]++;
            //cerr<<q[j]<<endl;
        }
    }

    for(int i = 1; i <= n; i++){
        int curB = bc - 1;
        while(mp[curB][(1 + Dec[curB])%mod] == 0){
            curB--;
            //assert(curB != -1);
        }
        if(curB < 0) break;
        int idx = -1;
        for(int j = min(n - 1, (curB + 1)*bs - 1); j >= curB*bs; j--){
            if(ans[j]) continue;
            if(q[j] == (1 + Dec[curB])%mod){
                ans[j] = i;
                mp[curB].clear();
                idx = j;
                break;
            }
        }
        int deg = 0;
        for(int j = bs*curB; j < min(bs*(curB + 1), n); j++){
            if(ans[j]){
                if(j == idx){ 
                    deg = del[j] - (j == 0 ? 0 : del[j - 1]);
                    if(deg < 0) deg += mod;
                }
                continue;
            }
            q[j] -= deg;
            if(q[j] < 0) q[j] += mod;
            mp[curB][q[j]]++;
        }
        for(int j = curB + 1; j < bc; j++){
            Dec[j] += deg;
            if(Dec[j] >= mod) Dec[j] -= mod;
        }
    }

    for(int i = 0; i < n; i++)
        cout<<ans[i]<<" ";



    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8064 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8064 KB Output is correct
2 Correct 12 ms 8064 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8064 KB Output is correct
2 Correct 12 ms 8064 KB Output is correct
3 Correct 18 ms 8192 KB Output is correct
4 Correct 16 ms 8192 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8064 KB Output is correct
2 Correct 12 ms 8064 KB Output is correct
3 Correct 18 ms 8192 KB Output is correct
4 Correct 16 ms 8192 KB Output is correct
5 Correct 911 ms 11472 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8064 KB Output is correct
2 Correct 12 ms 8064 KB Output is correct
3 Correct 18 ms 8192 KB Output is correct
4 Correct 16 ms 8192 KB Output is correct
5 Correct 911 ms 11472 KB Output is correct
6 Correct 3347 ms 71116 KB Output is correct

Subtask #6
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8064 KB Output is correct
2 Correct 12 ms 8064 KB Output is correct
3 Correct 18 ms 8192 KB Output is correct
4 Correct 16 ms 8192 KB Output is correct
5 Correct 911 ms 11472 KB Output is correct
6 Correct 3347 ms 71116 KB Output is correct
7 Runtime error 3755 ms 235544 KB Execution killed with signal 8

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8064 KB Output is correct
2 Correct 12 ms 8064 KB Output is correct
3 Correct 18 ms 8192 KB Output is correct
4 Correct 16 ms 8192 KB Output is correct
5 Correct 911 ms 11472 KB Output is correct
6 Correct 3347 ms 71116 KB Output is correct
7 Runtime error 3755 ms 235544 KB Execution killed with signal 8

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8064 KB Output is correct
2 Correct 12 ms 8064 KB Output is correct
3 Correct 18 ms 8192 KB Output is correct
4 Correct 16 ms 8192 KB Output is correct
5 Correct 911 ms 11472 KB Output is correct
6 Correct 3347 ms 71116 KB Output is correct
7 Runtime error 3755 ms 235544 KB Execution killed with signal 8