oj.uz

Submission #423259

# Submission time Handle Problem Language Result Execution time Memory
423259 2021-06-10T20:55:48 Z MDario Ancient Books (IOI17_books) C++11
50 / 100
 184 ms 31440 KB 
#include "books.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first.first
#define S first.second
#define T second
long long minimum_walk(vector<int> p, int s){
    ll n=p.size(), r=0, x=n, y=0, z=-1;
    bool b[n];
    for(int i=0; i<n; i++){
        b[i]=0;
        if(i==p[i])b[i]=1;
    }
    vector<pair<pair<ll, ll>, vector<ll>>> v;
    vector<ll> v1;
    for(ll i=0; i<n; i++){
        if(!b[i]){
            v1.clear();
            //cout << z << " ";
            if(i>=z){
                if(z!=-1)r+=2*(i-z);
            }
            r+=p[i]-i;
            y=p[i];
            while(y!=i){
                v1.push_back(y);
                z=max(z, y);
                b[y]=1;
                r+=abs(p[y]-y);
                y=p[y];
            }
            v1.push_back(y);
            b[y]=1;
            z=max(z, y);
            v.push_back({{i, z}, v1});
        }
    }
    if(v.empty())return 0;
    unique(v.begin(), v.end());
    sort(v.begin(), v.end());
    if(s>v.back().S)return r+2*(s-v.back().S);
    if(s<=v[0].F) return r+2*(v[0].F-s);
    x=n;
    z=0;
    for(int i=0; i<v.size(); i++){
        if(i+1==v.size()){
            if(s>=v[i].F&&s<=v[i].S&&v[i].S>z){
                //cout << v[i].F << " " << v[i].S << "\n";
                for(int t=0; t<v[i].T.size(); t++)x=min(x, abs(s-v[i].T[t]));
                z=v[i].S;
            }
        }
        else if(v[i+1].F!=v[i].F){
            if(s>=v[i].F&&s<=v[i].S&&v[i].S>z){
                for(int t=0; t<v[i].T.size(); t++)x=min(x, abs(s-v[i].T[t]));
                z=v[i].S;
            }
        }
    }
    if(x==n)return r;
	return r+2*x;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:46:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<long long int, long long int>, std::vector<long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     for(int i=0; i<v.size(); i++){
      |                  ~^~~~~~~~~
books.cpp:47:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<long long int, long long int>, std::vector<long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |         if(i+1==v.size()){
      |            ~~~^~~~~~~~~~
books.cpp:50:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |                 for(int t=0; t<v[i].T.size(); t++)x=min(x, abs(s-v[i].T[t]));
      |                              ~^~~~~~~~~~~~~~
books.cpp:56:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |                 for(int t=0; t<v[i].T.size(); t++)x=min(x, abs(s-v[i].T[t]));
      |                              ~^~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 292 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 288 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 292 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 288 KB Output is correct
30 Correct 184 ms 27632 KB Output is correct
31 Correct 164 ms 24540 KB Output is correct
32 Correct 121 ms 13632 KB Output is correct
33 Correct 161 ms 28496 KB Output is correct
34 Correct 160 ms 28484 KB Output is correct
35 Correct 169 ms 30172 KB Output is correct
36 Correct 163 ms 31440 KB Output is correct
37 Correct 138 ms 22848 KB Output is correct
38 Correct 134 ms 21844 KB Output is correct
39 Correct 133 ms 21804 KB Output is correct
40 Correct 141 ms 21996 KB Output is correct
41 Correct 149 ms 24132 KB Output is correct
42 Correct 144 ms 22652 KB Output is correct
43 Correct 176 ms 31180 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB 3rd lines differ - on the 1st token, expected: '3304', found: '3590'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 292 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 288 KB Output is correct
30 Correct 184 ms 27632 KB Output is correct
31 Correct 164 ms 24540 KB Output is correct
32 Correct 121 ms 13632 KB Output is correct
33 Correct 161 ms 28496 KB Output is correct
34 Correct 160 ms 28484 KB Output is correct
35 Correct 169 ms 30172 KB Output is correct
36 Correct 163 ms 31440 KB Output is correct
37 Correct 138 ms 22848 KB Output is correct
38 Correct 134 ms 21844 KB Output is correct
39 Correct 133 ms 21804 KB Output is correct
40 Correct 141 ms 21996 KB Output is correct
41 Correct 149 ms 24132 KB Output is correct
42 Correct 144 ms 22652 KB Output is correct
43 Correct 176 ms 31180 KB Output is correct
44 Incorrect 1 ms 204 KB 3rd lines differ - on the 1st token, expected: '3304', found: '3590'
45 Halted 0 ms 0 KB -