oj.uz

Submission #390609

# Submission time Handle Problem Language Result Execution time Memory
390609 2021-04-16T11:37:59 Z mehrdad_sohrabi Ancient Books (IOI17_books) C++14
50 / 100
 222 ms 25508 KB 
#include <bits/stdc++.h>
#include "books.h"
using namespace std;
typedef long long int ll;
typedef complex<double> point;
typedef long double ld;
#define pb push_back
#define pii pair < ll , ll >
#define F first
#define S second
//#define endl '\n'
#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#define kill(x) return cout<<x<<'\n', 0;
const int N=1e6+10;

ll vis[N];

long long minimum_walk(std::vector<int32_t> p, int32_t s) {
    memset(vis,0,sizeof vis);
    vector <pii> baz;
    ll n=p.size();
    ll ans=0;
    for (int i=0;i<n;i++){
       // cout << i << " rf" << endl;
        if (vis[i] || p[i]==i) continue;
        ll mn=i,mx=i;
        ll j=p[i];
        ans+=abs(p[i]-i);
        while(j!=i){
            ans+=abs(p[j]-j);
        //    cout << j << " " << p[j] << endl;
            mn=min(mn,j);
            mx=max(mx,j);
            vis[j]=1;
            j=p[j];
        }
        vis[i]=1;
        baz.pb({mn,-mx});
    }
 //   cout << ans << endl;
    sort(baz.begin(),baz.end());
    vector <pii> a;
    if (baz.size()){
    a.pb(baz[0]);
    for (int i=1;i<baz.size();i++){
        pii p=baz[i],q=a.back();
        if (-p.S<=-q.S) continue;
        if (p.F<=-q.S){
            a.pop_back();
            q.S=p.S;
            a.pb(q);
        }
        else
            a.pb(baz[i]);
    }
        ll p1=0;
        if (a[0].F>s){
            ans+=(a[0].F-s)*2;
            p1=1;
        }
        if (-a.back().S<s){
            ans+=(s+a.back().S)*2;
            p1=1;
        }
        if (p1==0){
            while(true){
                ll mn=s;
                ll j=p[s];
                while(j!=s){
                    mn=min(mn,j);
                    j=p[j];
                }
                s=mn;
                ll z=lower_bound(a.begin(),a.end(),pii(mn,(ll)-1e9))-a.begin();
                if (z==a.size() || a[z].F!=mn){
                    ans+=2;
                    s--;
                }
                else break;
            }
        }
        for (int i=1;i<a.size();i++){
            ans+=(a[i].F+a[i-1].S)*2;
        }
    }
    return ans;
}
/*
int32_t main() {
	int32_t n, s;
	assert(2 == scanf("%d %d", &n, &s));

	vector<int32_t> p((unsigned) n);
	for(int i = 0; i < n; i++)
		assert(1 == scanf("%d", &p[(unsigned) i]));

	long long res = minimum_walk(p, s);
	printf("%lld\n", res);

	return 0;
}
*/
/*
4 0
0 2 3 1
4 2
1 3 2 0
*/

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int32_t)':
books.cpp:47:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     for (int i=1;i<baz.size();i++){
      |                  ~^~~~~~~~~~~
books.cpp:77:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |                 if (z==a.size() || a[z].F!=mn){
      |                     ~^~~~~~~~~~
books.cpp:84:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |         for (int i=1;i<a.size();i++){
      |                      ~^~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8012 KB Output is correct
2 Correct 5 ms 8012 KB Output is correct
3 Correct 5 ms 8056 KB Output is correct
4 Correct 4 ms 8012 KB Output is correct
5 Correct 5 ms 8012 KB Output is correct
6 Correct 4 ms 8012 KB Output is correct
7 Correct 5 ms 8012 KB Output is correct
8 Correct 5 ms 8060 KB Output is correct
9 Correct 4 ms 8012 KB Output is correct
10 Correct 4 ms 8012 KB Output is correct
11 Correct 4 ms 8012 KB Output is correct
12 Correct 4 ms 8012 KB Output is correct
13 Correct 5 ms 8080 KB Output is correct
14 Correct 4 ms 8012 KB Output is correct
15 Correct 5 ms 8012 KB Output is correct
16 Correct 5 ms 8012 KB Output is correct
17 Correct 5 ms 8012 KB Output is correct
18 Correct 5 ms 8012 KB Output is correct
19 Correct 5 ms 8012 KB Output is correct
20 Correct 5 ms 8012 KB Output is correct
21 Correct 5 ms 8012 KB Output is correct
22 Correct 4 ms 8012 KB Output is correct
23 Correct 5 ms 8140 KB Output is correct
24 Correct 5 ms 8140 KB Output is correct
25 Correct 5 ms 8140 KB Output is correct
26 Correct 4 ms 8012 KB Output is correct
27 Correct 4 ms 8012 KB Output is correct
28 Correct 5 ms 8016 KB Output is correct
29 Correct 5 ms 8140 KB Output is correct
30 Correct 222 ms 15856 KB Output is correct
31 Correct 197 ms 15928 KB Output is correct
32 Correct 121 ms 15936 KB Output is correct
33 Correct 158 ms 25136 KB Output is correct
34 Correct 139 ms 25136 KB Output is correct
35 Correct 143 ms 25508 KB Output is correct
36 Correct 145 ms 21808 KB Output is correct
37 Correct 128 ms 16564 KB Output is correct
38 Correct 137 ms 16176 KB Output is correct
39 Correct 130 ms 16180 KB Output is correct
40 Correct 133 ms 15936 KB Output is correct
41 Correct 150 ms 15928 KB Output is correct
42 Correct 144 ms 16004 KB Output is correct
43 Correct 143 ms 20148 KB Output is correct

Subtask #4
0 / 20.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8012 KB Output is correct
2 Correct 5 ms 8012 KB Output is correct
3 Correct 5 ms 8056 KB Output is correct
4 Correct 4 ms 8012 KB Output is correct
5 Correct 5 ms 8012 KB Output is correct
6 Correct 4 ms 8012 KB Output is correct
7 Correct 5 ms 8012 KB Output is correct
8 Correct 5 ms 8060 KB Output is correct
9 Correct 4 ms 8012 KB Output is correct
10 Correct 4 ms 8012 KB Output is correct
11 Correct 4 ms 8012 KB Output is correct
12 Correct 4 ms 8012 KB Output is correct
13 Correct 5 ms 8080 KB Output is correct
14 Correct 4 ms 8012 KB Output is correct
15 Correct 5 ms 8012 KB Output is correct
16 Correct 5 ms 8012 KB Output is correct
17 Correct 5 ms 8012 KB Output is correct
18 Correct 5 ms 8012 KB Output is correct
19 Correct 5 ms 8012 KB Output is correct
20 Correct 5 ms 8012 KB Output is correct
21 Correct 5 ms 8012 KB Output is correct
22 Correct 4 ms 8012 KB Output is correct
23 Correct 5 ms 8140 KB Output is correct
24 Correct 5 ms 8140 KB Output is correct
25 Correct 5 ms 8140 KB Output is correct
26 Correct 4 ms 8012 KB Output is correct
27 Correct 4 ms 8012 KB Output is correct
28 Correct 5 ms 8016 KB Output is correct
29 Correct 5 ms 8140 KB Output is correct
30 Correct 222 ms 15856 KB Output is correct
31 Correct 197 ms 15928 KB Output is correct
32 Correct 121 ms 15936 KB Output is correct
33 Correct 158 ms 25136 KB Output is correct
34 Correct 139 ms 25136 KB Output is correct
35 Correct 143 ms 25508 KB Output is correct
36 Correct 145 ms 21808 KB Output is correct
37 Correct 128 ms 16564 KB Output is correct
38 Correct 137 ms 16176 KB Output is correct
39 Correct 130 ms 16180 KB Output is correct
40 Correct 133 ms 15936 KB Output is correct
41 Correct 150 ms 15928 KB Output is correct
42 Correct 144 ms 16004 KB Output is correct
43 Correct 143 ms 20148 KB Output is correct
44 Incorrect 5 ms 8012 KB 3rd lines differ - on the 1st token, expected: '3304', found: '3314'
45 Halted 0 ms 0 KB -