답안 #71201

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
71201 2018-08-24T08:08:15 Z Kmcode 고대 책들 (IOI17_books) C++14
22 / 100
193 ms 19648 KB
#include<bits/stdc++.h>
//#include "books.h"
using namespace std;


int im1[100002];
int im2[100002];

long long minimum_walk(std::vector<int> p, int s) {
	for(int i=0;i<p.size();i++){
		if(i<=p[i]){
			im1[i]++;
			im1[p[i]]--;
		}
		else{
			im2[i]++;
			im2[p[i]]--;
		}
	}
	for(int i=1;i<p.size();i++){
		im1[i]+=im1[i-1];
		im2[i]+=im2[i-1];
	}
	int ava=0;
	long long int turn=0;
	for(int i=p.size()-1;i>=0;i--){
		if(im1[i]||im2[i]){
			ava=1;
		}
		int need=max(im1[i],im2[i]);
		need*=2;
		need=max(need,ava*2);
		turn+=need;
	}
	return turn;
}


Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:10:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<p.size();i++){
              ~^~~~~~~~~
books.cpp:20:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1;i<p.size();i++){
              ~^~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 452 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 608 KB Output is correct
7 Correct 3 ms 608 KB Output is correct
8 Correct 3 ms 608 KB Output is correct
9 Correct 3 ms 608 KB Output is correct
10 Correct 3 ms 704 KB Output is correct
11 Correct 2 ms 704 KB Output is correct
12 Correct 2 ms 704 KB Output is correct
13 Correct 3 ms 704 KB Output is correct
14 Correct 3 ms 704 KB Output is correct
15 Correct 2 ms 704 KB Output is correct
16 Correct 3 ms 704 KB Output is correct
17 Correct 3 ms 704 KB Output is correct
18 Correct 3 ms 704 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 452 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 608 KB Output is correct
7 Correct 3 ms 608 KB Output is correct
8 Correct 3 ms 608 KB Output is correct
9 Correct 3 ms 608 KB Output is correct
10 Correct 3 ms 704 KB Output is correct
11 Correct 2 ms 704 KB Output is correct
12 Correct 2 ms 704 KB Output is correct
13 Correct 3 ms 704 KB Output is correct
14 Correct 3 ms 704 KB Output is correct
15 Correct 2 ms 704 KB Output is correct
16 Correct 3 ms 704 KB Output is correct
17 Correct 3 ms 704 KB Output is correct
18 Correct 3 ms 704 KB Output is correct
19 Correct 3 ms 704 KB Output is correct
20 Correct 3 ms 704 KB Output is correct
21 Correct 2 ms 704 KB Output is correct
22 Correct 3 ms 704 KB Output is correct
23 Correct 3 ms 704 KB Output is correct
24 Correct 2 ms 704 KB Output is correct
25 Correct 3 ms 704 KB Output is correct
26 Correct 3 ms 704 KB Output is correct
27 Correct 3 ms 704 KB Output is correct
28 Correct 3 ms 796 KB Output is correct
29 Correct 4 ms 796 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 452 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 608 KB Output is correct
7 Correct 3 ms 608 KB Output is correct
8 Correct 3 ms 608 KB Output is correct
9 Correct 3 ms 608 KB Output is correct
10 Correct 3 ms 704 KB Output is correct
11 Correct 2 ms 704 KB Output is correct
12 Correct 2 ms 704 KB Output is correct
13 Correct 3 ms 704 KB Output is correct
14 Correct 3 ms 704 KB Output is correct
15 Correct 2 ms 704 KB Output is correct
16 Correct 3 ms 704 KB Output is correct
17 Correct 3 ms 704 KB Output is correct
18 Correct 3 ms 704 KB Output is correct
19 Correct 3 ms 704 KB Output is correct
20 Correct 3 ms 704 KB Output is correct
21 Correct 2 ms 704 KB Output is correct
22 Correct 3 ms 704 KB Output is correct
23 Correct 3 ms 704 KB Output is correct
24 Correct 2 ms 704 KB Output is correct
25 Correct 3 ms 704 KB Output is correct
26 Correct 3 ms 704 KB Output is correct
27 Correct 3 ms 704 KB Output is correct
28 Correct 3 ms 796 KB Output is correct
29 Correct 4 ms 796 KB Output is correct
30 Runtime error 193 ms 19648 KB Execution killed with signal 11 (could be triggered by violating memory limits)
31 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 19648 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 452 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 608 KB Output is correct
7 Correct 3 ms 608 KB Output is correct
8 Correct 3 ms 608 KB Output is correct
9 Correct 3 ms 608 KB Output is correct
10 Correct 3 ms 704 KB Output is correct
11 Correct 2 ms 704 KB Output is correct
12 Correct 2 ms 704 KB Output is correct
13 Correct 3 ms 704 KB Output is correct
14 Correct 3 ms 704 KB Output is correct
15 Correct 2 ms 704 KB Output is correct
16 Correct 3 ms 704 KB Output is correct
17 Correct 3 ms 704 KB Output is correct
18 Correct 3 ms 704 KB Output is correct
19 Correct 3 ms 704 KB Output is correct
20 Correct 3 ms 704 KB Output is correct
21 Correct 2 ms 704 KB Output is correct
22 Correct 3 ms 704 KB Output is correct
23 Correct 3 ms 704 KB Output is correct
24 Correct 2 ms 704 KB Output is correct
25 Correct 3 ms 704 KB Output is correct
26 Correct 3 ms 704 KB Output is correct
27 Correct 3 ms 704 KB Output is correct
28 Correct 3 ms 796 KB Output is correct
29 Correct 4 ms 796 KB Output is correct
30 Runtime error 193 ms 19648 KB Execution killed with signal 11 (could be triggered by violating memory limits)
31 Halted 0 ms 0 KB -