Submission #272128

#	Time	Username	Problem	Language	Result	Execution time	Memory
272128		egekabas	Permutation Recovery (info1cup17_permutation)	C++14	60 / 100	4086 ms	17292 KiB

Main

#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<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
ll sq = 100;
ll mod = 2987623948576237;
ll n;
ll a[70009];
vector<pll> v[70009];
unordered_map<ll, ll> val[70009];

void restruct(){
    vector<ll> tmp;
    for(ll i = 0; v[i].size(); ++i){
        val[i].clear();
        for(auto u : v[i])
            tmp.pb(u.ss);
        v[i].clear();
    }
    for(ll i = 0; i < tmp.size(); ++i){
        if(v[i/sq].empty())
            v[i/sq].pb({a[tmp[i]], tmp[i]});
        else
            v[i/sq].pb({(a[tmp[i]]+v[i/sq].back().ff)%mod, tmp[i]});    
        
        val[i/sq][v[i/sq].back().ff] = v[i/sq].size();
    }
}
ll 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(ll 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(ll i = n; i >= 1; --i){
        a[i] = a[i]-a[i-1]+mod;
        if(a[i] >= mod)
            a[i] -= mod;
    }
    for(ll i = 1; i <= n; ++i){
        ll lookfor = a[i]-1;
        for(ll j = 0;; ++j){
            if(a[i] == 1 || val[j][lookfor]){
                ll seg = j, idx = val[j][lookfor]-1, num = i;
                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';
                }
                break;
            }
            lookfor = lookfor-v[j].back().ff+mod;
            if(lookfor >= mod)
                lookfor -= mod;
            if(v[j].empty()) break;
        }
        if(i%sq == 0)
            restruct();
    }
    ll cur = 1;
    for(ll i = 0; v[i].size(); ++i)
        for(auto u : v[i])
            ans[u.ss] = cur++;
    for(ll i = 1; i <= n; ++i)
        cout << ans[i] << ' ';
}

Compilation message (stderr)

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

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 18 / 18
• Subtask 4: 17 / 17
• Subtask 5: 0 / 11
• Subtask 6: 0 / 7
• Subtask 7: 0 / 16
• Subtask 8: 0 / 6