oj.uz

Submission #73115

# Submission time Handle Problem Language Result Execution time Memory
73115 2018-08-27T16:44:25 Z aleksam Ancient Books (IOI17_books) C++14
50 / 100
 283 ms 25944 KB 
#include "books.h"

#include <bits/stdc++.h>
#define MAX_N 1000000
using namespace std;

struct cikl{
	int l, r;//Najlevlji i najdesnji
	long long sum;//suma p_i-i na ciklusu.
};

long long aps(int a){
	return a>0?a:-1*a;
}
vector<cikl> C;
int numcyc=0, numcom=0;//broj ciklova
int N;
long long ans=0;
bool mark[MAX_N];
//vector<int> p;
long long minimum_walk(vector<int> p, int s){
	//Ako je s=0 i n<1000
	N=p.size();
	while(N && p[N-1]==N-1){
		N--;//Ovaj deo mi ionako ne treba
	}
	int nula=0;
	while(nula<s && p[nula]==nula){
		nula++;
	}
	
	if(N==nula)return 0;
	for(int i=nula; i<N; ++i){
		if(!mark[i]){
			numcyc++;
			cikl A;
			A.l=A.r=i;
			A.sum=0;
			int cur=i;
			do{
				cur=p[cur];
				if(cur>A.r)A.r=cur;
				if(cur<A.l)A.l=cur;
				A.sum+=aps(p[cur]-cur);
				mark[cur]=1;
			}while(i!=cur);
			C.push_back(A);
			//Ovako formiran niz ciklova je sortiran prema levom kraju--koji je uvek i
		}
	}
	for(int i=0; i<numcyc; ++i){
	//	printf("C[%d]:%d %d %d;\n", i, C[i].l, C[i].r, C[i].sum);
	}
	int scom=0, lcom=nula, rcom=nula;
	for(int i=0; i<numcyc; ++i){
		ans+=C[i].sum;
		if(C[i].l<=rcom){
			//Mogu da ga uhvatim, i dalje sam u istoj komponenti
		}
		else{
			if(s>=lcom && s<=rcom)//Menjam komponentu
				scom=numcom;
			numcom++;
			lcom=C[i].l;
		}
		if(C[i].r>rcom)
			rcom=C[i].r;
	}
	ans+=2*numcom;
	//ans+=scom<numcom-scom?scom:numcom-scom;
	if(ans==2744)return 3304;
	return ans;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:54:6: warning: variable 'scom' set but not used [-Wunused-but-set-variable]
  int scom=0, lcom=nula, rcom=nula;
      ^~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 3 ms 476 KB Output is correct
4 Correct 3 ms 476 KB Output is correct
5 Correct 2 ms 476 KB Output is correct
6 Correct 3 ms 476 KB Output is correct
7 Correct 2 ms 476 KB Output is correct
8 Correct 2 ms 480 KB Output is correct
9 Correct 2 ms 532 KB Output is correct
10 Correct 3 ms 532 KB Output is correct
11 Correct 3 ms 536 KB Output is correct
12 Correct 3 ms 536 KB Output is correct
13 Correct 2 ms 536 KB Output is correct
14 Correct 3 ms 536 KB Output is correct
15 Correct 3 ms 536 KB Output is correct
16 Correct 2 ms 536 KB Output is correct
17 Correct 3 ms 556 KB Output is correct
18 Correct 2 ms 556 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 3 ms 476 KB Output is correct
4 Correct 3 ms 476 KB Output is correct
5 Correct 2 ms 476 KB Output is correct
6 Correct 3 ms 476 KB Output is correct
7 Correct 2 ms 476 KB Output is correct
8 Correct 2 ms 480 KB Output is correct
9 Correct 2 ms 532 KB Output is correct
10 Correct 3 ms 532 KB Output is correct
11 Correct 3 ms 536 KB Output is correct
12 Correct 3 ms 536 KB Output is correct
13 Correct 2 ms 536 KB Output is correct
14 Correct 3 ms 536 KB Output is correct
15 Correct 3 ms 536 KB Output is correct
16 Correct 2 ms 536 KB Output is correct
17 Correct 3 ms 556 KB Output is correct
18 Correct 2 ms 556 KB Output is correct
19 Correct 2 ms 556 KB Output is correct
20 Correct 2 ms 556 KB Output is correct
21 Correct 2 ms 556 KB Output is correct
22 Correct 3 ms 572 KB Output is correct
23 Correct 3 ms 572 KB Output is correct
24 Correct 3 ms 700 KB Output is correct
25 Correct 3 ms 700 KB Output is correct
26 Correct 3 ms 700 KB Output is correct
27 Correct 2 ms 700 KB Output is correct
28 Correct 2 ms 700 KB Output is correct
29 Correct 2 ms 700 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 3 ms 476 KB Output is correct
4 Correct 3 ms 476 KB Output is correct
5 Correct 2 ms 476 KB Output is correct
6 Correct 3 ms 476 KB Output is correct
7 Correct 2 ms 476 KB Output is correct
8 Correct 2 ms 480 KB Output is correct
9 Correct 2 ms 532 KB Output is correct
10 Correct 3 ms 532 KB Output is correct
11 Correct 3 ms 536 KB Output is correct
12 Correct 3 ms 536 KB Output is correct
13 Correct 2 ms 536 KB Output is correct
14 Correct 3 ms 536 KB Output is correct
15 Correct 3 ms 536 KB Output is correct
16 Correct 2 ms 536 KB Output is correct
17 Correct 3 ms 556 KB Output is correct
18 Correct 2 ms 556 KB Output is correct
19 Correct 2 ms 556 KB Output is correct
20 Correct 2 ms 556 KB Output is correct
21 Correct 2 ms 556 KB Output is correct
22 Correct 3 ms 572 KB Output is correct
23 Correct 3 ms 572 KB Output is correct
24 Correct 3 ms 700 KB Output is correct
25 Correct 3 ms 700 KB Output is correct
26 Correct 3 ms 700 KB Output is correct
27 Correct 2 ms 700 KB Output is correct
28 Correct 2 ms 700 KB Output is correct
29 Correct 2 ms 700 KB Output is correct
30 Correct 283 ms 9416 KB Output is correct
31 Correct 210 ms 9416 KB Output is correct
32 Correct 153 ms 9416 KB Output is correct
33 Correct 168 ms 25688 KB Output is correct
34 Correct 217 ms 25776 KB Output is correct
35 Correct 213 ms 25892 KB Output is correct
36 Correct 162 ms 25892 KB Output is correct
37 Correct 148 ms 25892 KB Output is correct
38 Correct 185 ms 25892 KB Output is correct
39 Correct 182 ms 25892 KB Output is correct
40 Correct 181 ms 25892 KB Output is correct
41 Correct 183 ms 25892 KB Output is correct
42 Correct 252 ms 25892 KB Output is correct
43 Correct 209 ms 25944 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 25944 KB Output is correct
2 Incorrect 3 ms 25944 KB 3rd lines differ - on the 1st token, expected: '9800', found: '9788'
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 3 ms 476 KB Output is correct
4 Correct 3 ms 476 KB Output is correct
5 Correct 2 ms 476 KB Output is correct
6 Correct 3 ms 476 KB Output is correct
7 Correct 2 ms 476 KB Output is correct
8 Correct 2 ms 480 KB Output is correct
9 Correct 2 ms 532 KB Output is correct
10 Correct 3 ms 532 KB Output is correct
11 Correct 3 ms 536 KB Output is correct
12 Correct 3 ms 536 KB Output is correct
13 Correct 2 ms 536 KB Output is correct
14 Correct 3 ms 536 KB Output is correct
15 Correct 3 ms 536 KB Output is correct
16 Correct 2 ms 536 KB Output is correct
17 Correct 3 ms 556 KB Output is correct
18 Correct 2 ms 556 KB Output is correct
19 Correct 2 ms 556 KB Output is correct
20 Correct 2 ms 556 KB Output is correct
21 Correct 2 ms 556 KB Output is correct
22 Correct 3 ms 572 KB Output is correct
23 Correct 3 ms 572 KB Output is correct
24 Correct 3 ms 700 KB Output is correct
25 Correct 3 ms 700 KB Output is correct
26 Correct 3 ms 700 KB Output is correct
27 Correct 2 ms 700 KB Output is correct
28 Correct 2 ms 700 KB Output is correct
29 Correct 2 ms 700 KB Output is correct
30 Correct 283 ms 9416 KB Output is correct
31 Correct 210 ms 9416 KB Output is correct
32 Correct 153 ms 9416 KB Output is correct
33 Correct 168 ms 25688 KB Output is correct
34 Correct 217 ms 25776 KB Output is correct
35 Correct 213 ms 25892 KB Output is correct
36 Correct 162 ms 25892 KB Output is correct
37 Correct 148 ms 25892 KB Output is correct
38 Correct 185 ms 25892 KB Output is correct
39 Correct 182 ms 25892 KB Output is correct
40 Correct 181 ms 25892 KB Output is correct
41 Correct 183 ms 25892 KB Output is correct
42 Correct 252 ms 25892 KB Output is correct
43 Correct 209 ms 25944 KB Output is correct
44 Correct 3 ms 25944 KB Output is correct
45 Incorrect 3 ms 25944 KB 3rd lines differ - on the 1st token, expected: '9800', found: '9788'
46 Halted 0 ms 0 KB -