oj.uz

답안 #429114

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
429114 2021-06-15T17:33:50 Z Dremix10 고대 책들 (IOI17_books) C++17
50 / 100
 398 ms 34840 KB 
#include "books.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
#define endl '\n'
#define F first
#define S second
#define all(x) (x).begin(),(x).end()
const int N = 1e6+5;
const ll INF = 2e18;
const int MOD = 1e9+7;

int l[N],r[N],par[N];

int find(int x){
    return (par[x] == x) ? x : par[x] = find(par[x]);
}

void join(int x, int y){
    x = find(x);
    y = find(y);
    if(x==y)return;
    par[y] = x;
    l[x] = min(l[x],l[y]);
    r[x] = max(r[x],r[y]);
}

long long minimum_walk(vector<int> p, int s) {
    int i,j,n = p.size();

    ll ans = 0;
    bool ok[n] = {};
    int cnt = 0;

    for(i=0;i<n;i++){
        if(p[i] == i){
            ok[i] = true;
            cnt++;
        }
        l[i] = i,r[i] = i,par[i] = i;
    }

    i = 0;

    while(cnt < n){
        while(ok[i]){
            i++;
            //ans++;
        }
        int fin = i;
        ans += abs(p[i] - i);
        i = p[i];
        ok[i] = true;
        cnt++;
        while(i != fin){
            join(i,fin);
            ans += abs(p[i] - i);
            i = p[i];
            ok[i] = true;
            cnt++;
        }
        //cout<<cnt<<" "<<ans<<" "<<i<<endl;
    }

    int low=s,high=s;
    i=s,j=s;
    while(i>0 || j<n-1){
        int curr;
        if(i >= 0)
            curr = find(i);
        else
            curr = find(j);
        bool ok = 0;

        low = min(low,l[curr]);
        while(i > low){
            i--;
            ok = 1;
            join(curr,i);
            low = min(low,l[curr]);
        }

        high = max(high,r[curr]);
        while(j < high){
            j++;
            ok = 1;
            join(curr,j);
            high = max(high,r[curr]);
        }

        if(!ok){
            i--;
            while(i>=0 && i==par[i])
                i--;

            j++;
            while(j<n && j==par[j])
                j++;

            if(i==-1 && j==n)break;
            if(i==-1 || j<n && low-i > j-high){
                /// go right (high)
                ans += (j-high)*2;
                join(curr,j);
                i = low;
            }
            else{
                assert(j==n || i>=0 && low-i < j-high);
                /// go left (low)
                ans += (low-i)*2;
                join(curr,i);
                j = high;
            }
        }
    }

    return ans;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:103:29: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  103 |             if(i==-1 || j<n && low-i > j-high){
      |                         ~~~~^~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from books.cpp:2:
books.cpp:110:37: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  110 |                 assert(j==n || i>=0 && low-i < j-high);
      |                                ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 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 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 216 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 292 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 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 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 216 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 292 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 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 304 KB Output is correct
20 Correct 1 ms 296 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 296 KB Output is correct

Subtask #3
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 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 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 216 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 292 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 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 304 KB Output is correct
20 Correct 1 ms 296 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 296 KB Output is correct
30 Correct 379 ms 34840 KB Output is correct
31 Correct 398 ms 29864 KB Output is correct
32 Correct 150 ms 27460 KB Output is correct
33 Correct 147 ms 27480 KB Output is correct
34 Correct 144 ms 27484 KB Output is correct
35 Correct 160 ms 27552 KB Output is correct
36 Correct 174 ms 27492 KB Output is correct
37 Correct 164 ms 27460 KB Output is correct
38 Correct 155 ms 27476 KB Output is correct
39 Correct 168 ms 27620 KB Output is correct
40 Correct 179 ms 27756 KB Output is correct
41 Correct 247 ms 30172 KB Output is correct
42 Correct 225 ms 29276 KB Output is correct
43 Correct 153 ms 27484 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB 3rd lines differ - on the 1st token, expected: '3304', found: '3484'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 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 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 216 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 292 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 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 304 KB Output is correct
20 Correct 1 ms 296 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 296 KB Output is correct
30 Correct 379 ms 34840 KB Output is correct
31 Correct 398 ms 29864 KB Output is correct
32 Correct 150 ms 27460 KB Output is correct
33 Correct 147 ms 27480 KB Output is correct
34 Correct 144 ms 27484 KB Output is correct
35 Correct 160 ms 27552 KB Output is correct
36 Correct 174 ms 27492 KB Output is correct
37 Correct 164 ms 27460 KB Output is correct
38 Correct 155 ms 27476 KB Output is correct
39 Correct 168 ms 27620 KB Output is correct
40 Correct 179 ms 27756 KB Output is correct
41 Correct 247 ms 30172 KB Output is correct
42 Correct 225 ms 29276 KB Output is correct
43 Correct 153 ms 27484 KB Output is correct
44 Incorrect 1 ms 204 KB 3rd lines differ - on the 1st token, expected: '3304', found: '3484'
45 Halted 0 ms 0 KB -