oj.uz

답안 #782277

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
782277 2023-07-13T17:49:44 Z APROHACK 고대 책들 (IOI17_books) C++14
50 / 100
 220 ms 21048 KB 
#include "books.h"
#include <bits/stdc++.h>
#define ll long long 
#define ff first
#define ss second
#define pb push_back
using namespace std;
int nn;
ll bit[1000006]; // prefix sum hacia adelante.
void update(int pos, int val){
	for(int i = pos ; i <= nn ; i += i&(-i)){
		bit[i] += val;
	}
}
ll query(int donde){
	ll ans = 0;
	for(int i = donde ; i > 0 ; i -= i&(-i)){
		ans += bit[i];
	}
	return ans;
}
bool vis[1000006];
vector<int>perm;
ll minimo = 0;
void go(int i, int j){
	if(i < j){
		update(i, 1);
		update(j, -1);
	}else if( j < i ){
		update(j, 1);
		update(i, -1);
	}
	minimo += abs(i - j);
}

void run(int u){
	if(vis[u])return ;
	vis[u] = true;
	go(u, perm[u]);
	run(perm[u]);
}


long long minimum_walk(std::vector<int> p, int s) {
	nn = p.size();
	perm.pb(0);
	for(int i = 0 ; i < p.size() ; i ++){
		//cout << s << endl;
		perm.pb(p[i]+1);
		//cout << perm.back() << " ";
	}
	//cout << endl;
	
	for(int i = 0 ; i <= nn ; i ++){
		vis[i] = false;
		bit[i] = 0;
	}
	for(int i = 1 ; i < nn ; i ++){
		if(!vis[i])run(i);
	}
	ll mas = 0, cur = 0;
	
	for(int i = 1 ; i < nn ; i ++){
		if(query(i) == 0){
			cur += 2;
		}else{
			mas += cur;
			cur = 0;
		}
	}
	//cout << minimo << " " << mas << endl;
	return minimo + mas;
	
	
	
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:47:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |  for(int i = 0 ; i < p.size() ; i ++){
      |                  ~~^~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct

Subtask #3
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 172 ms 20964 KB Output is correct
31 Correct 220 ms 20980 KB Output is correct
32 Correct 82 ms 20968 KB Output is correct
33 Correct 108 ms 20960 KB Output is correct
34 Correct 111 ms 20988 KB Output is correct
35 Correct 119 ms 20964 KB Output is correct
36 Correct 121 ms 20968 KB Output is correct
37 Correct 124 ms 20976 KB Output is correct
38 Correct 120 ms 20960 KB Output is correct
39 Correct 125 ms 21048 KB Output is correct
40 Correct 127 ms 20980 KB Output is correct
41 Correct 139 ms 20972 KB Output is correct
42 Correct 140 ms 20976 KB Output is correct
43 Correct 111 ms 20920 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 172 ms 20964 KB Output is correct
31 Correct 220 ms 20980 KB Output is correct
32 Correct 82 ms 20968 KB Output is correct
33 Correct 108 ms 20960 KB Output is correct
34 Correct 111 ms 20988 KB Output is correct
35 Correct 119 ms 20964 KB Output is correct
36 Correct 121 ms 20968 KB Output is correct
37 Correct 124 ms 20976 KB Output is correct
38 Correct 120 ms 20960 KB Output is correct
39 Correct 125 ms 21048 KB Output is correct
40 Correct 127 ms 20980 KB Output is correct
41 Correct 139 ms 20972 KB Output is correct
42 Correct 140 ms 20976 KB Output is correct
43 Correct 111 ms 20920 KB Output is correct
44 Incorrect 1 ms 340 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45 Halted 0 ms 0 KB -