oj.uz

답안 #787812

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
787812 2023-07-19T12:55:34 Z QwertyPi 고대 책들 (IOI17_books) C++14
0 / 100
 2000 ms 312 KB 
#include "books.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e6 + 11;

struct range{
	int l, r;
	bool extend(range rg){
		bool changed = false;
		if(rg.l < l) changed = true, l = rg.l;
		if(rg.r > r) changed = true, r = rg.r;
		return changed;
	}
	friend bool operator!= (const range& s, const range& t){
		return s.l != t.l || s.r != t.r;
	}
};

bool vis[MAXN];
range cyc[MAXN];

long long minimum_walk(vector<int> p, int s) {
	int n = p.size(); 
	long long ans = 0;
	for(int i = 0; i < n; i++){
		ans += abs(p[i] - i);
	}
	
	for(int i = 0; i < n; i++){
		if(!vis[i]){
			vector<int> c = {i}; int x = p[i]; range r = {i, i};
			while(x != c[0]){
				r.extend({x, x});
				c.push_back(x); 
				vis[x] = true; 
				x = p[x];
			}
			for(auto j : c) cyc[j] = r;
		}
	}
	
	for(int i = s - 1; i >= 0; i--){
		cyc[i].extend(cyc[i + 1]);
	}
	
	for(int i = s + 1; i < n; i++){
		cyc[i].extend(cyc[i - 1]);
	}
	
	{
		range cur = cyc[s], nxt;
		do{
			nxt = cur;
			nxt.extend(cyc[nxt.l]);
			nxt.extend(cyc[nxt.r]);
		}while(cur != nxt);
		cyc[s] = nxt;
	}
	for(int i = s - 1; i >= 0; i--){
		cyc[i].extend(cyc[i + 1]);
		range cur = cyc[i], nxt;
		do{
			nxt = cur;
			nxt.extend(cyc[nxt.l]);
			nxt.extend(cyc[nxt.r]);
		}while(cur != nxt);
		cyc[i] = nxt;
	}
	for(int i = s + 1; i < n; i++){
		cyc[i].extend(cyc[i - 1]);
		range cur = cyc[i], nxt;
		do{
			nxt = cur;
			nxt.extend(cyc[nxt.l]);
			nxt.extend(cyc[nxt.r]);
		}while(cur != nxt);
		cyc[i] = nxt;
	}
	
	int c = 0;
	while(cyc[c].r != n - 1){
		c = cyc[c].r; ++c; ans += 2;
	}
	return ans;
}

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 1 ms 212 KB 3rd lines differ - on the 1st token, expected: '4', found: '6'
6 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 1 ms 212 KB 3rd lines differ - on the 1st token, expected: '4', found: '6'
6 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 1 ms 212 KB 3rd lines differ - on the 1st token, expected: '4', found: '6'
6 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2044 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 1 ms 212 KB 3rd lines differ - on the 1st token, expected: '4', found: '6'
6 Halted 0 ms 0 KB -