# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
103736 | ekrem | Zalmoxis (BOI18_zalmoxis) | C++98 | 1091 ms | 86288 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define mod 1000000007
#define N 1000005
using namespace std;
typedef long long ll;
typedef pair < int , int > ii;
int n, k, m, a[N], b[N], bas[N], son[N];
ii ans;
set < ii > s, q;
set < ii > :: iterator it;
vector < int > g[N];
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
scanf("%d %d",&n ,&k);
for(int i = 1; i <= n; i++){
scanf("%d",a + i);
g[a[i]].pb(i);
bas[i] = i;
son[i] = i;
}
for(int i = 1; i <= 30; i++){
sort(g[i].begin(), g[i].end());
for(int j = 0; j < g[i].size(); j++)
if(j < (int)g[i].size() - 1 and son[g[i][j]] == bas[g[i][j + 1]]){
g[i + 1].pb(g[i][j + 1]);
bas[g[i][j + 1]] = bas[g[i][j]];
} else{
ans = mp(g[i][j], a[g[i][j]]);
g[i + 1].pb(g[i][j]);
}
}
for(int i = 1; i <= n; i++){
printf("%d ", a[i]);
if(i == ans.st)
printf("%d ", ans.nd);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |