oj.uz

Submission #984120

# Submission time Handle Problem Language Result Execution time Memory
984120 2024-05-16T10:21:15 Z CSQ31 Ancient Books (IOI17_books) C++17
0 / 100
 1 ms 348 KB 
#include "books.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
typedef long long int ll;
typedef pair<int,int> pii;
const int MAXN = 1e6+1;
int mn[MAXN],mx[MAXN];
ll ans = 0;
int n = 0;
vector<int>p;
void extend(int &l,int &r){
	int l0 = min(mn[l],mn[r]);
	int r0 = min(mx[l],mx[r]);
	while(l0 < l || r < r0){
		while(l0 < l){
			l--;
			l0 = min(l0,mn[l]);
			r0 = max(r0,mx[l]);
		}
		while(r0 > r){
			r++;
			l0 = min(l0,mn[r]);
			r0 = max(r0,mx[r]);
		}
	}
}
void solve(int l,int r){
	extend(l,r);
	cout<<l<<" "<<r<<'\n';
	int rcost = 0;
	int lcost = 0;

	int l0 = l,r0 = r;
	int L = l,R = r;
	r++;
	while(r < n){
		rcost += 2;
		extend(l,r);
		if(l < l0)break;
		r++;
	}
	L = l;
	R = r;
	l = l0,r = r0;

	l--;
	while(l >= 0){
		lcost+=2;
		extend(l,r);
		if(r > r0)break;
		l--;
	}
	L = min(L,l);
	R = max(R,r);
	cout<<L<<" "<<R<<'\n';
	if(R == n){ //end of the line
	    ans += rcost;
		ans += lcost;
		return;
	}

	ans += min(lcost,rcost);
	solve(L,R);
}
ll minimum_walk(vector<int>P, int s) {
	p = P;
	n = sz(p);
	for(int i=0;i<n;i++)ans+=abs(i-p[i]);
	vector<bool>vis(n,0);
	for(int i=0;i<n;i++){
		if(!vis[i])continue;
		int cur = i;

		vector<int>path;
		while(!vis[cur]){
			vis[cur] = 1;
			path.push_back(cur);
			cur = p[cur];
		}
		for(int x:path){
			mn[i] = min(mn[i],x);
			mx[i] = max(mx[i],x);
		}
		for(int x:path){
			mn[x] = mn[i];
			mx[x] = mx[i];
		}
	}
	solve(s,s);
	for(int i=0;i<s;i++){
		if(i==p[i])ans-=2;
		else break;
	}
	for(int i=n-1;i>s;i--){
		if(i==p[i])ans-=2;
		else break;
	}
	return ans;	
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB secret mismatch
2 Halted 0 ms 0 KB -