Submission #390590

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
390590	2021-04-16T10:52:56 Z	mehrdad_sohrabi	Ancient Books (IOI17_books)	C++14	12 / 100	5 ms	8124 KB

books

#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]);
    }
    ans+=a.back().F*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
*/

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++){
      |                  ~^~~~~~~~~~~

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	4 ms	8012 KB	Output is correct
4	Correct	4 ms	8012 KB	Output is correct
5	Correct	4 ms	8012 KB	Output is correct
6	Correct	4 ms	8012 KB	Output is correct
7	Correct	5 ms	8124 KB	Output is correct
8	Correct	4 ms	8012 KB	Output is correct
9	Correct	5 ms	8076 KB	Output is correct
10	Correct	4 ms	8012 KB	Output is correct
11	Correct	4 ms	8092 KB	Output is correct
12	Correct	4 ms	8012 KB	Output is correct
13	Correct	4 ms	8024 KB	Output is correct
14	Correct	4 ms	8012 KB	Output is correct
15	Correct	4 ms	8012 KB	Output is correct
16	Correct	5 ms	8012 KB	Output is correct
17	Correct	4 ms	8056 KB	Output is correct
18	Correct	5 ms	8012 KB	Output is correct

Subtask #2
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	4 ms	8012 KB	Output is correct
4	Correct	4 ms	8012 KB	Output is correct
5	Correct	4 ms	8012 KB	Output is correct
6	Correct	4 ms	8012 KB	Output is correct
7	Correct	5 ms	8124 KB	Output is correct
8	Correct	4 ms	8012 KB	Output is correct
9	Correct	5 ms	8076 KB	Output is correct
10	Correct	4 ms	8012 KB	Output is correct
11	Correct	4 ms	8092 KB	Output is correct
12	Correct	4 ms	8012 KB	Output is correct
13	Correct	4 ms	8024 KB	Output is correct
14	Correct	4 ms	8012 KB	Output is correct
15	Correct	4 ms	8012 KB	Output is correct
16	Correct	5 ms	8012 KB	Output is correct
17	Correct	4 ms	8056 KB	Output is correct
18	Correct	5 ms	8012 KB	Output is correct
19	Correct	4 ms	8012 KB	Output is correct
20	Correct	4 ms	8080 KB	Output is correct
21	Correct	4 ms	8092 KB	Output is correct
22	Incorrect	4 ms	8012 KB	3rd lines differ - on the 1st token, expected: '2082', found: '2782'
23	Halted	0 ms	0 KB	-

Subtask #3
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	4 ms	8012 KB	Output is correct
4	Correct	4 ms	8012 KB	Output is correct
5	Correct	4 ms	8012 KB	Output is correct
6	Correct	4 ms	8012 KB	Output is correct
7	Correct	5 ms	8124 KB	Output is correct
8	Correct	4 ms	8012 KB	Output is correct
9	Correct	5 ms	8076 KB	Output is correct
10	Correct	4 ms	8012 KB	Output is correct
11	Correct	4 ms	8092 KB	Output is correct
12	Correct	4 ms	8012 KB	Output is correct
13	Correct	4 ms	8024 KB	Output is correct
14	Correct	4 ms	8012 KB	Output is correct
15	Correct	4 ms	8012 KB	Output is correct
16	Correct	5 ms	8012 KB	Output is correct
17	Correct	4 ms	8056 KB	Output is correct
18	Correct	5 ms	8012 KB	Output is correct
19	Correct	4 ms	8012 KB	Output is correct
20	Correct	4 ms	8080 KB	Output is correct
21	Correct	4 ms	8092 KB	Output is correct
22	Incorrect	4 ms	8012 KB	3rd lines differ - on the 1st token, expected: '2082', found: '2782'
23	Halted	0 ms	0 KB	-

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: '2744'
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	4 ms	8012 KB	Output is correct
4	Correct	4 ms	8012 KB	Output is correct
5	Correct	4 ms	8012 KB	Output is correct
6	Correct	4 ms	8012 KB	Output is correct
7	Correct	5 ms	8124 KB	Output is correct
8	Correct	4 ms	8012 KB	Output is correct
9	Correct	5 ms	8076 KB	Output is correct
10	Correct	4 ms	8012 KB	Output is correct
11	Correct	4 ms	8092 KB	Output is correct
12	Correct	4 ms	8012 KB	Output is correct
13	Correct	4 ms	8024 KB	Output is correct
14	Correct	4 ms	8012 KB	Output is correct
15	Correct	4 ms	8012 KB	Output is correct
16	Correct	5 ms	8012 KB	Output is correct
17	Correct	4 ms	8056 KB	Output is correct
18	Correct	5 ms	8012 KB	Output is correct
19	Correct	4 ms	8012 KB	Output is correct
20	Correct	4 ms	8080 KB	Output is correct
21	Correct	4 ms	8092 KB	Output is correct
22	Incorrect	4 ms	8012 KB	3rd lines differ - on the 1st token, expected: '2082', found: '2782'
23	Halted	0 ms	0 KB	-

Submission #390590

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 0 / 10.0

Subtask #3 0 / 28.0

Subtask #4 0 / 20.0

Subtask #5 0 / 30.0

Subtask #1
12.0 / 12.0

Subtask #2
0 / 10.0

Subtask #3
0 / 28.0

Subtask #4
0 / 20.0

Subtask #5
0 / 30.0