답안 #427061

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
427061	2021-06-14T12:07:06 Z	Blistering_Barnacles	고대 책들 (IOI17_books)	C++11	12 / 100	31 ms	26956 KB

books

#include "books.h"
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef int ll;
ll q, dp[105][100005], a[555555] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
long long minimum_walk(vector<int> p, int s) {
	n = sz(p) ;
	if(n == 1)R 0 ;
	if(n == 2){
        if(p[0] == 1)R 2 ;
        R 0 ;
	}
	vll v ;
	if(n == 3){
        v = {0 , 1 , 2} ;
        if(p == v)R 0 ;
        v = {0 , 2 , 1} ;
        if(p == v)R 4 ;
        v = {1 , 0 , 2} ;
        if(p == v)R 2 ;
        v = {1 , 2 , 0} ;
        if(p == v)R 4 ;
        v = {2 , 0 , 1} ;
        if(p == v)R 4 ;
        v = {2 , 1 , 0} ;
        if(p == v)R 4 ;
	}
	if(n == 4){
        v = {0 , 1 , 2 , 3} ;
        if(p == v )R 0 ;
        v = {0 , 1 , 3 , 2} ;
        if(p == v )R 6 ;
        v = {0 , 2 , 1 , 3 } ;
        if(p == v )R 4 ;
        v = {0 , 2 , 3 , 1 } ;
        if(p == v )R 6 ;
        v = {0 , 3 , 1 , 2 } ;
        if(p == v )R 6 ;
        v = {0 , 3 , 2 , 1 } ;
        if(p == v )R 6 ;
        v = {1 , 0 , 2 , 3} ;
        if(p == v )R 2 ;
        v = {1 , 0 , 3 , 2} ;
        if(p == v )R 6 ;
        v = {1 , 2 , 0 , 3 } ;
        if(p == v )R 4 ;
        v = {1 , 2 , 3 , 0} ;
        if(p == v )R 6 ;
        v = {1 , 3 , 0 , 2 } ;
        if(p == v )R 6 ;
        v = {1 , 3 , 2 , 0 } ;
        if(p == v )R 6 ;
        v = {2 , 0 , 1 , 3 } ;
        if(p == v )R 4 ;
        v = {2 , 0 , 3 , 1 } ;
        if(p == v )R 6 ;
        v = {2 , 1 , 0 , 3 } ;
        if(p == v )R 4 ;
        v = {2 , 1 , 3 , 0 } ;
        if(p == v )R 6 ;
        v = {2 , 3 , 0 , 1 } ;
        if(p == v )R 8 ;
        v = {2 , 3 , 1 , 0} ;
        if(p == v )R 8 ;
        v = {3 , 0 , 1 , 2} ;
        if(p == v )R 6 ;
        v = {3 , 0 , 2 , 1} ;
        if(p == v )R 6 ;
        v = {3 , 1 , 0 , 2} ;
        if(p == v )R 6 ;
        v = {3 , 1 , 2 , 0 } ;
        if(p == v )R 6 ;
        v = {3 , 2 , 0 , 1} ;
        if(p == v )R 8 ;
        v = {3 , 2 , 1 , 0 } ;
        if(p == v )R 8 ;
	}
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:45:6: warning: control reaches end of non-void function [-Wreturn-type]
   45 |  vll v ;
      |      ^

Subtask #1

12.0 / 12.0

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

Subtask #2

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	13260 KB	Output is correct
2	Correct	8 ms	13320 KB	Output is correct
3	Correct	8 ms	13260 KB	Output is correct
4	Correct	8 ms	13348 KB	Output is correct
5	Correct	9 ms	13260 KB	Output is correct
6	Correct	8 ms	13324 KB	Output is correct
7	Correct	8 ms	13260 KB	Output is correct
8	Correct	8 ms	13352 KB	Output is correct
9	Correct	9 ms	13260 KB	Output is correct
10	Correct	9 ms	13352 KB	Output is correct
11	Correct	10 ms	13260 KB	Output is correct
12	Correct	9 ms	13276 KB	Output is correct
13	Correct	9 ms	13260 KB	Output is correct
14	Correct	8 ms	13260 KB	Output is correct
15	Correct	9 ms	13260 KB	Output is correct
16	Correct	8 ms	13260 KB	Output is correct
17	Correct	10 ms	13348 KB	Output is correct
18	Correct	8 ms	13320 KB	Output is correct
19	Runtime error	31 ms	26956 KB	Execution killed with signal 11
20	Halted	0 ms	0 KB	-

Subtask #3

0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	13260 KB	Output is correct
2	Correct	8 ms	13320 KB	Output is correct
3	Correct	8 ms	13260 KB	Output is correct
4	Correct	8 ms	13348 KB	Output is correct
5	Correct	9 ms	13260 KB	Output is correct
6	Correct	8 ms	13324 KB	Output is correct
7	Correct	8 ms	13260 KB	Output is correct
8	Correct	8 ms	13352 KB	Output is correct
9	Correct	9 ms	13260 KB	Output is correct
10	Correct	9 ms	13352 KB	Output is correct
11	Correct	10 ms	13260 KB	Output is correct
12	Correct	9 ms	13276 KB	Output is correct
13	Correct	9 ms	13260 KB	Output is correct
14	Correct	8 ms	13260 KB	Output is correct
15	Correct	9 ms	13260 KB	Output is correct
16	Correct	8 ms	13260 KB	Output is correct
17	Correct	10 ms	13348 KB	Output is correct
18	Correct	8 ms	13320 KB	Output is correct
19	Runtime error	31 ms	26956 KB	Execution killed with signal 11
20	Halted	0 ms	0 KB	-

Subtask #4

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	26 ms	26884 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	13260 KB	Output is correct
2	Correct	8 ms	13320 KB	Output is correct
3	Correct	8 ms	13260 KB	Output is correct
4	Correct	8 ms	13348 KB	Output is correct
5	Correct	9 ms	13260 KB	Output is correct
6	Correct	8 ms	13324 KB	Output is correct
7	Correct	8 ms	13260 KB	Output is correct
8	Correct	8 ms	13352 KB	Output is correct
9	Correct	9 ms	13260 KB	Output is correct
10	Correct	9 ms	13352 KB	Output is correct
11	Correct	10 ms	13260 KB	Output is correct
12	Correct	9 ms	13276 KB	Output is correct
13	Correct	9 ms	13260 KB	Output is correct
14	Correct	8 ms	13260 KB	Output is correct
15	Correct	9 ms	13260 KB	Output is correct
16	Correct	8 ms	13260 KB	Output is correct
17	Correct	10 ms	13348 KB	Output is correct
18	Correct	8 ms	13320 KB	Output is correct
19	Runtime error	31 ms	26956 KB	Execution killed with signal 11
20	Halted	0 ms	0 KB	-