oj.uz

답안 #283835

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
283835 2020-08-26T07:47:22 Z erd1 고대 책들 (IOI17_books) C++14
50 / 100
 1678 ms 91124 KB 
#include "books.h"

#include<bits/stdc++.h>

using namespace std;
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef pair<int, int> pii;
typedef long long lld;
typedef long double ld;

template<typename Iter>
ostream& outIt(ostream& out, Iter b, Iter e){
	for(Iter i = b; i != e; ++i)
		out << (i == b?"":" ") << *i;
	return out;
}
template<typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> p){
	return out << '(' << p.ff << ", " << p.ss << ')';
}
template<typename T>
ostream& operator<<(ostream& out, vector<T> v){
	return outIt(out << '[', all(v)) << ']';
}
vector<pii> cs;
set<int> poss;
void add(vector<int>& p, int i){
	if(poss.count(i))return;
	poss.insert(i);
	add(p, p[i]);
}
long long minimum_walk(vector<int> p, int s) {
	lld ans = 0;
	int pmin = INT_MAX, pmax = INT_MIN;
	for(int i = 0; i < p.size(); i++)if(p[i] != i)ans += abs(p[i]-i), cs.pb({min(i, p[i]), max(i, p[i])}), pmin = min(pmin, i), pmax = max(pmax, i);
	if(ans == 0)return 0;
	sort(all(cs));
	int r = cs.front().ff;
	add(p, r);
	bool fl = true;
	for(int i = 0; i < cs.size(); i++){
		if(cs[i].ff > s && s > r)fl = false;
		if(cs[i].ff > r) add(p, r), add(p, cs[i].ff);
		ans += 2*max(0, cs[i].ff - r);
		r = max(r, cs[i].ss);
	}
	add(p, r);
	if(p.size() <= 1000){
		for(int j = 0; j < p.size(); j++){
			for(int i = 0; i < p.size(); i++){
				if(poss.count(i))continue;
				if(poss.lower_bound(i) != poss.lower_bound(p[i]))add(p, i);
			}
		}
	}
	if(fl){
		int l = s, r = s;
		while(l >= 0 && !poss.count(l))l--;
		while(r < p.size() && !poss.count(r))r++;
		if(l < 0)ans += 2*(r-s);
		else if(r == p.size()) ans += 2*(s-l);
		else ans += 2*min(r-s, s-l);
	}

	return ans;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:39:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |  for(int i = 0; i < p.size(); i++)if(p[i] != i)ans += abs(p[i]-i), cs.pb({min(i, p[i]), max(i, p[i])}), pmin = min(pmin, i), pmax = max(pmax, i);
      |                 ~~^~~~~~~~~~
books.cpp:45:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |  for(int i = 0; i < cs.size(); i++){
      |                 ~~^~~~~~~~~~~
books.cpp:53:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |   for(int j = 0; j < p.size(); j++){
      |                  ~~^~~~~~~~~~
books.cpp:54:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |    for(int i = 0; i < p.size(); i++){
      |                   ~~^~~~~~~~~~
books.cpp:63:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |   while(r < p.size() && !poss.count(r))r++;
      |         ~~^~~~~~~~~~
books.cpp:65:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |   else if(r == p.size()) ans += 2*(s-l);
      |           ~~^~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 34 ms 384 KB Output is correct
20 Correct 35 ms 384 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 58 ms 396 KB Output is correct
23 Correct 45 ms 384 KB Output is correct
24 Correct 49 ms 508 KB Output is correct
25 Correct 47 ms 384 KB Output is correct
26 Correct 38 ms 384 KB Output is correct
27 Correct 38 ms 384 KB Output is correct
28 Correct 36 ms 384 KB Output is correct
29 Correct 30 ms 384 KB Output is correct

Subtask #3
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 34 ms 384 KB Output is correct
20 Correct 35 ms 384 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 58 ms 396 KB Output is correct
23 Correct 45 ms 384 KB Output is correct
24 Correct 49 ms 508 KB Output is correct
25 Correct 47 ms 384 KB Output is correct
26 Correct 38 ms 384 KB Output is correct
27 Correct 38 ms 384 KB Output is correct
28 Correct 36 ms 384 KB Output is correct
29 Correct 30 ms 384 KB Output is correct
30 Correct 1678 ms 91124 KB Output is correct
31 Correct 889 ms 56020 KB Output is correct
32 Correct 154 ms 12396 KB Output is correct
33 Correct 304 ms 39060 KB Output is correct
34 Correct 296 ms 39012 KB Output is correct
35 Correct 353 ms 46548 KB Output is correct
36 Correct 402 ms 52692 KB Output is correct
37 Correct 410 ms 51668 KB Output is correct
38 Correct 469 ms 51140 KB Output is correct
39 Correct 468 ms 51376 KB Output is correct
40 Correct 548 ms 53820 KB Output is correct
41 Correct 1102 ms 71032 KB Output is correct
42 Correct 681 ms 53972 KB Output is correct
43 Correct 223 ms 18920 KB Output is correct

Subtask #4
0 / 20.0

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

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 34 ms 384 KB Output is correct
20 Correct 35 ms 384 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 58 ms 396 KB Output is correct
23 Correct 45 ms 384 KB Output is correct
24 Correct 49 ms 508 KB Output is correct
25 Correct 47 ms 384 KB Output is correct
26 Correct 38 ms 384 KB Output is correct
27 Correct 38 ms 384 KB Output is correct
28 Correct 36 ms 384 KB Output is correct
29 Correct 30 ms 384 KB Output is correct
30 Correct 1678 ms 91124 KB Output is correct
31 Correct 889 ms 56020 KB Output is correct
32 Correct 154 ms 12396 KB Output is correct
33 Correct 304 ms 39060 KB Output is correct
34 Correct 296 ms 39012 KB Output is correct
35 Correct 353 ms 46548 KB Output is correct
36 Correct 402 ms 52692 KB Output is correct
37 Correct 410 ms 51668 KB Output is correct
38 Correct 469 ms 51140 KB Output is correct
39 Correct 468 ms 51376 KB Output is correct
40 Correct 548 ms 53820 KB Output is correct
41 Correct 1102 ms 71032 KB Output is correct
42 Correct 681 ms 53972 KB Output is correct
43 Correct 223 ms 18920 KB Output is correct
44 Incorrect 14 ms 384 KB 3rd lines differ - on the 1st token, expected: '3304', found: '3590'
45 Halted 0 ms 0 KB -