oj.uz

Submission #270569

# Submission time Handle Problem Language Result Execution time Memory
270569 2020-08-17T18:37:24 Z egekabas Permutation Recovery (info1cup17_permutation) C++14
43 / 100
 846 ms 7792 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
int sq = 100;
int mod = 1e8+9;
int n;
int a[70009];
vector<pll> v[70009];
int tot[70009];
unordered_map<int, int> val[70009];
void add(int seg, int idx, int num){
    tot[seg] = tot[seg]+a[num];
    if(tot[seg] >= mod)
        tot[seg] -= mod;
    if(idx == -1)
        v[seg].insert(v[seg].begin()+idx+1, {a[num], num});
    else
        v[seg].insert(v[seg].begin()+idx+1, {(seg[v][idx].ff+a[num])%mod, num});
    for(int i = idx+2; i < v[seg].size(); ++i)
        val[seg].erase(v[seg][i].ff);      
    val[seg][seg[v][idx+1].ff] = idx+2;
    for(int i = idx+2; i < v[seg].size(); ++i){
        v[seg][i].ff = (a[v[seg][i].ss]+v[seg][i-1].ff);
        if(v[seg][i].ff >= mod)
            v[seg][i].ff -= mod;
        val[seg][v[seg][i].ff] = i+1;
        //cout << i << " -- " << v[seg][i].ff << '\n';
    
    }
}
void restruct(){
    vector<int> tmp;
    for(int i = 0; v[i].size(); ++i){
        val[i].clear();
        for(auto u : v[i])
            tmp.pb(u.ss);
        v[i].clear();
        tot[i] = 0;
    }
    for(int i = 0; i < tmp.size(); ++i)
        add(i/sq, v[i/sq].size()-1, tmp[i]);
}
int ans[70009];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    
    cin >> n;
    for(int i = 1; i <= n; ++i){
        string s;
        cin >> s;
        for(auto u : s){
            a[i] = a[i]*10%mod;
            a[i] += u-'0';
            if(a[i] >= mod)
                a[i]-=mod;
        }
    }
    for(int i = n; i >= 1; --i){
        a[i] = a[i]-a[i-1]+mod;
        if(a[i] >= mod)
            a[i] -= mod;
    }
    for(int i = 1; i <= n; ++i){
        int lookfor = a[i]-1;
        for(int j = 0;; ++j){
            if(a[i] == 1 || val[j][lookfor]){
                add(j, val[j][lookfor]-1, i);
                break;
            }
            lookfor = lookfor-tot[j]+mod;
            if(lookfor >= mod)
                lookfor -= mod;
            if(v[j].empty()) break;
        }
        if(i%sq == 0)
            restruct();
    }
    int cur = 1;
    for(int i = 0; v[i].size(); ++i)
        for(auto u : v[i])
            ans[u.ss] = cur++;
    for(int i = 1; i <= n; ++i)
        cout << ans[i] << ' ';
}

Compilation message

permutation.cpp: In function 'void add(int, int, int)':
permutation.cpp:30:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(int i = idx+2; i < v[seg].size(); ++i)
      |                        ~~^~~~~~~~~~~~~~~
permutation.cpp:33:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for(int i = idx+2; i < v[seg].size(); ++i){
      |                        ~~^~~~~~~~~~~~~~~
permutation.cpp: In function 'void restruct()':
permutation.cpp:51:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     for(int i = 0; i < tmp.size(); ++i)
      |                    ~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5760 KB Output is correct
2 Correct 7 ms 5888 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5760 KB Output is correct
2 Correct 7 ms 5888 KB Output is correct
3 Correct 7 ms 5888 KB Output is correct
4 Correct 6 ms 5888 KB Output is correct

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5760 KB Output is correct
2 Correct 7 ms 5888 KB Output is correct
3 Correct 7 ms 5888 KB Output is correct
4 Correct 6 ms 5888 KB Output is correct
5 Incorrect 846 ms 7792 KB Output isn't correct

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5760 KB Output is correct
2 Correct 7 ms 5888 KB Output is correct
3 Correct 7 ms 5888 KB Output is correct
4 Correct 6 ms 5888 KB Output is correct
5 Incorrect 846 ms 7792 KB Output isn't correct

Subtask #6
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5760 KB Output is correct
2 Correct 7 ms 5888 KB Output is correct
3 Correct 7 ms 5888 KB Output is correct
4 Correct 6 ms 5888 KB Output is correct
5 Incorrect 846 ms 7792 KB Output isn't correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5760 KB Output is correct
2 Correct 7 ms 5888 KB Output is correct
3 Correct 7 ms 5888 KB Output is correct
4 Correct 6 ms 5888 KB Output is correct
5 Incorrect 846 ms 7792 KB Output isn't correct

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5760 KB Output is correct
2 Correct 7 ms 5888 KB Output is correct
3 Correct 7 ms 5888 KB Output is correct
4 Correct 6 ms 5888 KB Output is correct
5 Incorrect 846 ms 7792 KB Output isn't correct