oj.uz

Submission #283861

# Submission time Handle Problem Language Result Execution time Memory
283861 2020-08-26T08:19:07 Z erd1 Ancient Books (IOI17_books) C++14
50 / 100
 279 ms 34136 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;
vector<int> poss, dist, gone;
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;
	gone.resize(p.size()), poss.resize(p.size()), dist.resize(p.size());
	poss[r] = 1;
	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) poss[r] = poss[cs[i].ff] = 1;
		ans += 2*max(0, cs[i].ff - r);
		r = max(r, cs[i].ss);
	}
	poss[r] = 1;
	//cout << poss << endl;
	if(!fl)return ans;
	for(int i = 0; i < p.size(); i++)dist[i] = abs(i-s);
	//cout << dist << gone << endl;
	for(int i = 0; i < p.size(); i++){
		pii mins = {INT_MAX, -1};
		for(int j = 0; j < p.size(); j++)if(!gone[j])mins = min(mins, {dist[j], j});
		gone[mins.ss] = true;
		//cout << s << " " << mins << endl;
		dist[p[mins.ss]] = min(dist[p[mins.ss]], mins.ff);
		if(poss[mins.ss])return ans + 2*mins.ff;
		for(int j = 0; j < p.size(); j++){
			dist[j] = min(dist[j], mins.ff + abs(mins.ss - j));
		}
	}
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:34:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |  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:41: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]
   41 |  for(int i = 0; i < cs.size(); i++){
      |                 ~~^~~~~~~~~~~
books.cpp:50:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |  for(int i = 0; i < p.size(); i++)dist[i] = abs(i-s);
      |                 ~~^~~~~~~~~~
books.cpp:52:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |  for(int i = 0; i < p.size(); i++){
      |                 ~~^~~~~~~~~~
books.cpp:54:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |   for(int j = 0; j < p.size(); j++)if(!gone[j])mins = min(mins, {dist[j], j});
      |                  ~~^~~~~~~~~~
books.cpp:59:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |   for(int j = 0; j < p.size(); j++){
      |                  ~~^~~~~~~~~~
books.cpp:63:1: warning: control reaches end of non-void function [-Wreturn-type]
   63 | }
      | ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 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 0 ms 256 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 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 0 ms 256 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 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 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 288 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 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 0 ms 256 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 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 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 288 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 276 ms 34136 KB Output is correct
31 Correct 279 ms 33928 KB Output is correct
32 Correct 131 ms 14456 KB Output is correct
33 Correct 196 ms 30304 KB Output is correct
34 Correct 183 ms 30176 KB Output is correct
35 Correct 179 ms 31452 KB Output is correct
36 Correct 226 ms 33244 KB Output is correct
37 Correct 222 ms 33876 KB Output is correct
38 Correct 229 ms 34032 KB Output is correct
39 Correct 249 ms 34132 KB Output is correct
40 Correct 252 ms 34132 KB Output is correct
41 Correct 275 ms 34132 KB Output is correct
42 Correct 270 ms 33428 KB Output is correct
43 Correct 257 ms 27212 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB 3rd lines differ - on the 1st token, expected: '3304', found: '3312'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 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 0 ms 256 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 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 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 288 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 276 ms 34136 KB Output is correct
31 Correct 279 ms 33928 KB Output is correct
32 Correct 131 ms 14456 KB Output is correct
33 Correct 196 ms 30304 KB Output is correct
34 Correct 183 ms 30176 KB Output is correct
35 Correct 179 ms 31452 KB Output is correct
36 Correct 226 ms 33244 KB Output is correct
37 Correct 222 ms 33876 KB Output is correct
38 Correct 229 ms 34032 KB Output is correct
39 Correct 249 ms 34132 KB Output is correct
40 Correct 252 ms 34132 KB Output is correct
41 Correct 275 ms 34132 KB Output is correct
42 Correct 270 ms 33428 KB Output is correct
43 Correct 257 ms 27212 KB Output is correct
44 Incorrect 4 ms 384 KB 3rd lines differ - on the 1st token, expected: '3304', found: '3312'
45 Halted 0 ms 0 KB -