Submission #51059

# Submission time Handle Problem Language Result Execution time Memory
51059 2018-06-15T22:22:06 Z FLDutchman Ancient Books (IOI17_books) C++14
22 / 100
415 ms 72100 KB
#include "books.h"
#include "bits/stdc++.h"
using namespace std;

#define pb push_back
#define fst first
#define snd second
#define FOR(i, l, r) for(int i = l; i < r; i++)

typedef vector<int> vi;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;

const int NMAX = 1e6 + 10;
const int INF = 1e9;

vi cycles[NMAX];
int numCycles, N;
bitset<NMAX> vis;
vi point;

void flood(int n, int c){
	//cout << "Flood " << n << " " << c << endl;
	cycles[c].pb(n);
	int k = point[n];
	vis[n] = 1;
	if(!vis[k]) flood(k, c); 
}

// 
ii bounds(int p, int c){
	//cout << p << endl;
	auto &cy = cycles[c];	
	if(cy[0] > p) return {-1, cy[0]};
	if(cy.back() <= p) return {cy.back(), INF};
	auto x = lower_bound(cycles[c].begin(), cycles[c].end(), p);
	return {*x, *(++x)};
}

long long minimum_walk(std::vector<int> p, int s) {
	vis.reset();
	point = p;
	N = p.size();
	FOR(i, 0, N) if(!vis[i]) flood(i, numCycles++);
	FOR(i, 0, numCycles) sort(cycles[i].begin(), cycles[i].end());
	//cout << "Preprocessed" << endl;
	//ii k = bounds(2, 1);
	//cout << k.fst << " " << k.snd << endl;
	//Find segments:
	vii segs;
	int rm = 0;
	int lm = 0;
	//cout << "numCycles: " << numCycles << endl;
	FOR(i, 0, numCycles){
		//cout << lm << " " << rm << endl;
		if(cycles[i].size() == 1) continue;
		if(rm <= cycles[i][0]) {
			if(rm - lm > 1) segs.pb({lm, rm});
			lm = cycles[i][0]; rm = cycles[i].back()+1;
		}
		rm = max(rm, cycles[i].back()+1);
	}

	if(rm - lm > 1) segs.pb({lm, rm});

	//cout << segs.size() << endl;
	int dist = 0;
	if(segs.size() > 0)
		dist  = segs[0].fst*2;
	//cout << dist << endl;
	FOR(i, 0, N) dist += abs(i - p[i]);
	//cout << dist << endl;
	//cout << segs.size() - 1 << endl;
	//FOR(i, 0, (int)segs.size()) cout << segs[i].fst << " " << segs[i].snd << endl;
	FOR(i, 0, (int)segs.size()-1){
		dist += 2*(segs[i+1].fst - (segs[i].snd-1) );
	}
	//cout << "sfdf" << endl;
	return dist;
}
/*
3 1
0 2 1

4 0
0 1 3 2

4 0
2 3 0 1
4 0
0 1 2 3

10 0
0 1 4 5 2 3 7 6 9 8
*/
# Verdict Execution time Memory Grader output
1 Correct 22 ms 23892 KB Output is correct
2 Correct 21 ms 23912 KB Output is correct
3 Correct 25 ms 24124 KB Output is correct
4 Correct 21 ms 24124 KB Output is correct
5 Correct 21 ms 24128 KB Output is correct
6 Correct 21 ms 24204 KB Output is correct
7 Correct 21 ms 24204 KB Output is correct
8 Correct 21 ms 24204 KB Output is correct
9 Correct 21 ms 24204 KB Output is correct
10 Correct 21 ms 24204 KB Output is correct
11 Correct 25 ms 24204 KB Output is correct
12 Correct 21 ms 24204 KB Output is correct
13 Correct 21 ms 24204 KB Output is correct
14 Correct 21 ms 24204 KB Output is correct
15 Correct 21 ms 24204 KB Output is correct
16 Correct 22 ms 24292 KB Output is correct
17 Correct 24 ms 24292 KB Output is correct
18 Correct 21 ms 24292 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 22 ms 23892 KB Output is correct
2 Correct 21 ms 23912 KB Output is correct
3 Correct 25 ms 24124 KB Output is correct
4 Correct 21 ms 24124 KB Output is correct
5 Correct 21 ms 24128 KB Output is correct
6 Correct 21 ms 24204 KB Output is correct
7 Correct 21 ms 24204 KB Output is correct
8 Correct 21 ms 24204 KB Output is correct
9 Correct 21 ms 24204 KB Output is correct
10 Correct 21 ms 24204 KB Output is correct
11 Correct 25 ms 24204 KB Output is correct
12 Correct 21 ms 24204 KB Output is correct
13 Correct 21 ms 24204 KB Output is correct
14 Correct 21 ms 24204 KB Output is correct
15 Correct 21 ms 24204 KB Output is correct
16 Correct 22 ms 24292 KB Output is correct
17 Correct 24 ms 24292 KB Output is correct
18 Correct 21 ms 24292 KB Output is correct
19 Correct 21 ms 24292 KB Output is correct
20 Correct 25 ms 24292 KB Output is correct
21 Correct 21 ms 24292 KB Output is correct
22 Correct 21 ms 24292 KB Output is correct
23 Correct 21 ms 24292 KB Output is correct
24 Correct 21 ms 24292 KB Output is correct
25 Correct 22 ms 24292 KB Output is correct
26 Correct 22 ms 24292 KB Output is correct
27 Correct 22 ms 24292 KB Output is correct
28 Correct 22 ms 24292 KB Output is correct
29 Correct 22 ms 24292 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 22 ms 23892 KB Output is correct
2 Correct 21 ms 23912 KB Output is correct
3 Correct 25 ms 24124 KB Output is correct
4 Correct 21 ms 24124 KB Output is correct
5 Correct 21 ms 24128 KB Output is correct
6 Correct 21 ms 24204 KB Output is correct
7 Correct 21 ms 24204 KB Output is correct
8 Correct 21 ms 24204 KB Output is correct
9 Correct 21 ms 24204 KB Output is correct
10 Correct 21 ms 24204 KB Output is correct
11 Correct 25 ms 24204 KB Output is correct
12 Correct 21 ms 24204 KB Output is correct
13 Correct 21 ms 24204 KB Output is correct
14 Correct 21 ms 24204 KB Output is correct
15 Correct 21 ms 24204 KB Output is correct
16 Correct 22 ms 24292 KB Output is correct
17 Correct 24 ms 24292 KB Output is correct
18 Correct 21 ms 24292 KB Output is correct
19 Correct 21 ms 24292 KB Output is correct
20 Correct 25 ms 24292 KB Output is correct
21 Correct 21 ms 24292 KB Output is correct
22 Correct 21 ms 24292 KB Output is correct
23 Correct 21 ms 24292 KB Output is correct
24 Correct 21 ms 24292 KB Output is correct
25 Correct 22 ms 24292 KB Output is correct
26 Correct 22 ms 24292 KB Output is correct
27 Correct 22 ms 24292 KB Output is correct
28 Correct 22 ms 24292 KB Output is correct
29 Correct 22 ms 24292 KB Output is correct
30 Incorrect 415 ms 72100 KB 3rd lines differ - on the 1st token, expected: '333035179244', found: '-1972269844'
31 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 72100 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 22 ms 23892 KB Output is correct
2 Correct 21 ms 23912 KB Output is correct
3 Correct 25 ms 24124 KB Output is correct
4 Correct 21 ms 24124 KB Output is correct
5 Correct 21 ms 24128 KB Output is correct
6 Correct 21 ms 24204 KB Output is correct
7 Correct 21 ms 24204 KB Output is correct
8 Correct 21 ms 24204 KB Output is correct
9 Correct 21 ms 24204 KB Output is correct
10 Correct 21 ms 24204 KB Output is correct
11 Correct 25 ms 24204 KB Output is correct
12 Correct 21 ms 24204 KB Output is correct
13 Correct 21 ms 24204 KB Output is correct
14 Correct 21 ms 24204 KB Output is correct
15 Correct 21 ms 24204 KB Output is correct
16 Correct 22 ms 24292 KB Output is correct
17 Correct 24 ms 24292 KB Output is correct
18 Correct 21 ms 24292 KB Output is correct
19 Correct 21 ms 24292 KB Output is correct
20 Correct 25 ms 24292 KB Output is correct
21 Correct 21 ms 24292 KB Output is correct
22 Correct 21 ms 24292 KB Output is correct
23 Correct 21 ms 24292 KB Output is correct
24 Correct 21 ms 24292 KB Output is correct
25 Correct 22 ms 24292 KB Output is correct
26 Correct 22 ms 24292 KB Output is correct
27 Correct 22 ms 24292 KB Output is correct
28 Correct 22 ms 24292 KB Output is correct
29 Correct 22 ms 24292 KB Output is correct
30 Incorrect 415 ms 72100 KB 3rd lines differ - on the 1st token, expected: '333035179244', found: '-1972269844'
31 Halted 0 ms 0 KB -