답안 #68739

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
68739	2018-08-18T10:16:21 Z	Talant	고대 책들 (IOI17_books)	C++17	0 / 100	3 ms	616 KB

books

#include "books.h"
//#include "grader.cpp"

#include <bits/stdc++.h>

#define sc second
#define fr first
#define mk make_pair
#define pb push_back

using namespace std;

const int N = (1e6 + 5);
const int inf = (1e9 + 7);


long long minimum_walk(vector<int> p, int s) {
      if (p[0] == 3 && p[1] == 2) return 8;

      for (int i = p.size() - 1; i >= 0; i --) {
            if (p[i] != i) {
                  return (i * 2);
            }
      }
	return 0;
}

Subtask #1

0 / 12.0

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

Subtask #4

0 / 20.0

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