oj.uz

답안 #74331

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
74331 2018-08-31T10:20:20 Z nvmdava 고대 책들 (IOI17_books) C++17
0 / 100
 2 ms 584 KB 
#include "books.h"
#include <bits/stdc++.h>
using namespace std;
int r = -1, l = 1000001;
vector<int> p;
bool in[1000001];
void go(int v){
	if(in[v] == 1){
		return;
	}
	in[v] = 1;
	r = max(r, v);
	go(p[v]);
}
 
long long minimum_walk(vector<int> p, int s) {
	::p = p;
	int q = 0;
	long long ans = 0;
	for(int i = 0; i < p.size(); i++){
		ans += (long long)abs(i - p[i]);
		if(in[i] || p[i] == i) continue;
		l = min(l, i);
		if(r < i && r != -1){
			ans += (long long)(i - r) * 2;
		}
		go(i);
	}
	if(s < l && l != 1000001){
		ans += (l - s) * 2;
	} else if(s > r){
		ans += (r - s) * 2;
	}
	return ans;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:20:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < p.size(); i++){
                 ~~^~~~~~~~~~
books.cpp:18:6: warning: unused variable 'q' [-Wunused-variable]
  int q = 0;
      ^

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 476 KB Output is correct
3 Correct 2 ms 476 KB Output is correct
4 Correct 2 ms 476 KB Output is correct
5 Correct 2 ms 500 KB Output is correct
6 Correct 2 ms 500 KB Output is correct
7 Correct 2 ms 500 KB Output is correct
8 Correct 2 ms 584 KB Output is correct
9 Incorrect 2 ms 584 KB 3rd lines differ - on the 1st token, expected: '0', found: '-2'
10 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 476 KB Output is correct
3 Correct 2 ms 476 KB Output is correct
4 Correct 2 ms 476 KB Output is correct
5 Correct 2 ms 500 KB Output is correct
6 Correct 2 ms 500 KB Output is correct
7 Correct 2 ms 500 KB Output is correct
8 Correct 2 ms 584 KB Output is correct
9 Incorrect 2 ms 584 KB 3rd lines differ - on the 1st token, expected: '0', found: '-2'
10 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 476 KB Output is correct
3 Correct 2 ms 476 KB Output is correct
4 Correct 2 ms 476 KB Output is correct
5 Correct 2 ms 500 KB Output is correct
6 Correct 2 ms 500 KB Output is correct
7 Correct 2 ms 500 KB Output is correct
8 Correct 2 ms 584 KB Output is correct
9 Incorrect 2 ms 584 KB 3rd lines differ - on the 1st token, expected: '0', found: '-2'
10 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 584 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 2 ms 376 KB Output is correct
2 Correct 2 ms 476 KB Output is correct
3 Correct 2 ms 476 KB Output is correct
4 Correct 2 ms 476 KB Output is correct
5 Correct 2 ms 500 KB Output is correct
6 Correct 2 ms 500 KB Output is correct
7 Correct 2 ms 500 KB Output is correct
8 Correct 2 ms 584 KB Output is correct
9 Incorrect 2 ms 584 KB 3rd lines differ - on the 1st token, expected: '0', found: '-2'
10 Halted 0 ms 0 KB -