답안 #1076066

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1076066	2024-08-26T10:54:49 Z	amin	고대 책들 (IOI17_books)	C++14	50 / 100	78 ms	12116 KB

books

#include "books.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
long long minimum_walk(vector<int> p, int s) {
	ll ans=0;
	ll n=p.size();
	ll ma=0;
	ll mi=-1;
	int o[n+1];
	for(int i=0;i<=n;i++)
    {
        o[i]=0;
    }
    int pre=0;
    for(int i=n-1;i>=0;i--)
    {


        if(p[i]==i)
        ans-=2;
        else
            break;
    }
     for(int i=0;i<s;i++)
    {


        if(p[i]==i)
        ans-=2;
        else
            break;
    }

    int h=0;
	for(int i=0;i<n;i++)
    {
        pre+=o[i];

       if(p[i]>i)
       {

h++;
        pre++;
        o[p[i]]--;
       }
       if(pre==0)
        ans+=2;

            ans+=abs(p[i]-i);
    }
if(h>0)
    ans-=2;
    return ans;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:52:1: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   52 | if(h>0)
      | ^~
books.cpp:54:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   54 |     return ans;
      |     ^~~~~~
books.cpp:8:5: warning: unused variable 'ma' [-Wunused-variable]
    8 |  ll ma=0;
      |     ^~
books.cpp:9:5: warning: unused variable 'mi' [-Wunused-variable]
    9 |  ll mi=-1;
      |     ^~

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct

Subtask #3
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	72 ms	12116 KB	Output is correct
31	Correct	75 ms	12112 KB	Output is correct
32	Correct	73 ms	12012 KB	Output is correct
33	Correct	72 ms	12116 KB	Output is correct
34	Correct	71 ms	12020 KB	Output is correct
35	Correct	74 ms	12116 KB	Output is correct
36	Correct	70 ms	12008 KB	Output is correct
37	Correct	73 ms	12028 KB	Output is correct
38	Correct	72 ms	12116 KB	Output is correct
39	Correct	72 ms	12032 KB	Output is correct
40	Correct	72 ms	12116 KB	Output is correct
41	Correct	73 ms	12116 KB	Output is correct
42	Correct	74 ms	12116 KB	Output is correct
43	Correct	78 ms	12112 KB	Output is correct

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	348 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	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	72 ms	12116 KB	Output is correct
31	Correct	75 ms	12112 KB	Output is correct
32	Correct	73 ms	12012 KB	Output is correct
33	Correct	72 ms	12116 KB	Output is correct
34	Correct	71 ms	12020 KB	Output is correct
35	Correct	74 ms	12116 KB	Output is correct
36	Correct	70 ms	12008 KB	Output is correct
37	Correct	73 ms	12028 KB	Output is correct
38	Correct	72 ms	12116 KB	Output is correct
39	Correct	72 ms	12032 KB	Output is correct
40	Correct	72 ms	12116 KB	Output is correct
41	Correct	73 ms	12116 KB	Output is correct
42	Correct	74 ms	12116 KB	Output is correct
43	Correct	78 ms	12112 KB	Output is correct
44	Incorrect	0 ms	348 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-

답안 #1076066

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 10.0 / 10.0

Subtask #3 28.0 / 28.0

Subtask #4 0 / 20.0

Subtask #5 0 / 30.0

Subtask #1
12.0 / 12.0

Subtask #2
10.0 / 10.0

Subtask #3
28.0 / 28.0

Subtask #4
0 / 20.0

Subtask #5
0 / 30.0