#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 = 300;
ll mod = 2987623948576237;
ll n;
ll a[70009];
vector<pll> v[70009];
ll tot[70009];
unordered_map<ll, ll> val[70009];
void add(ll seg, ll idx, ll 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<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();
tot[i] = 0;
}
for(ll i = 0; i < tmp.size(); ++i)
add(i/sq, v[i/sq].size()-1, tmp[i]);
}
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]){
add(j, val[j][lookfor]-1, i);
if(v[j].size() == 2*sq)
restruct();
break;
}
lookfor = lookfor-tot[j]+mod;
if(lookfor >= mod)
lookfor -= mod;
if(v[j].empty()) break;
}
}
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
permutation.cpp: In function 'void add(ll, ll, ll)':
permutation.cpp:30:26: 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]
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<long long int, long long 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: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]
51 | for(ll i = 0; i < tmp.size(); ++i)
| ~~^~~~~~~~~~~~
permutation.cpp: In function 'int main()':
permutation.cpp:83:32: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
83 | if(v[j].size() == 2*sq)
| ~~~~~~~~~~~~^~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
5760 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
5760 KB |
Output is correct |
| 2 |
Correct |
9 ms |
5888 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
5760 KB |
Output is correct |
| 2 |
Correct |
9 ms |
5888 KB |
Output is correct |
| 3 |
Correct |
13 ms |
5888 KB |
Output is correct |
| 4 |
Correct |
5 ms |
5888 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
5760 KB |
Output is correct |
| 2 |
Correct |
9 ms |
5888 KB |
Output is correct |
| 3 |
Correct |
13 ms |
5888 KB |
Output is correct |
| 4 |
Correct |
5 ms |
5888 KB |
Output is correct |
| 5 |
Correct |
2726 ms |
33532 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
5760 KB |
Output is correct |
| 2 |
Correct |
9 ms |
5888 KB |
Output is correct |
| 3 |
Correct |
13 ms |
5888 KB |
Output is correct |
| 4 |
Correct |
5 ms |
5888 KB |
Output is correct |
| 5 |
Correct |
2726 ms |
33532 KB |
Output is correct |
| 6 |
Execution timed out |
4073 ms |
30404 KB |
Time limit exceeded |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
5760 KB |
Output is correct |
| 2 |
Correct |
9 ms |
5888 KB |
Output is correct |
| 3 |
Correct |
13 ms |
5888 KB |
Output is correct |
| 4 |
Correct |
5 ms |
5888 KB |
Output is correct |
| 5 |
Correct |
2726 ms |
33532 KB |
Output is correct |
| 6 |
Execution timed out |
4073 ms |
30404 KB |
Time limit exceeded |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
5760 KB |
Output is correct |
| 2 |
Correct |
9 ms |
5888 KB |
Output is correct |
| 3 |
Correct |
13 ms |
5888 KB |
Output is correct |
| 4 |
Correct |
5 ms |
5888 KB |
Output is correct |
| 5 |
Correct |
2726 ms |
33532 KB |
Output is correct |
| 6 |
Execution timed out |
4073 ms |
30404 KB |
Time limit exceeded |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
5760 KB |
Output is correct |
| 2 |
Correct |
9 ms |
5888 KB |
Output is correct |
| 3 |
Correct |
13 ms |
5888 KB |
Output is correct |
| 4 |
Correct |
5 ms |
5888 KB |
Output is correct |
| 5 |
Correct |
2726 ms |
33532 KB |
Output is correct |
| 6 |
Execution timed out |
4073 ms |
30404 KB |
Time limit exceeded |
