oj.uz

답안 #918650

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
918650 2024-01-30T08:26:16 Z nightfal 고대 책들 (IOI17_books) C++14
100 / 100
 107 ms 22880 KB 
#include <cstdio>
#include <vector>
#include <cassert>
#include <cstdlib>
#include <tuple>
#include <climits>

using namespace std;

bool isSubtask3(int s) {return s==0;}
bool isSubtask4(int n) {return n<=1000;}

pair<int,int> extend(int l, int r, vector<int>& lmost, vector<int>& rmost) {
    while(l > min(lmost[l],lmost[r]) || r < max(rmost[l],rmost[r])) {
        l=min(l,min(lmost[l],lmost[r])); 
        r=max(r,max(rmost[r],rmost[l]));
    }
    return make_pair(l,r);
} 

long long fulltask(vector<int>& p, int s) {

    int n = p.size();

    int start; for(start = 0; start < s; start++) if(start!=p[start]) break;
    int end; for(end = n-1; end > s; end--) if(end!=p[end]) break;

    long long distBooks=0; for(int i=start; i<=end; i++) distBooks += abs(p[i]-i);

    int l = min(s,p[s]), r=max(s,p[s]); 
    vector<int> lmost(n), rmost(n); lmost[s] = min(s,p[s]); rmost[s] = max(s,p[s]);
    for(int i=s-1; i>=start; i--) {lmost[i] = min(lmost[i+1],p[i]); rmost[i] = max(rmost[i+1],p[i]);}
    for(int i=s+1; i<=end ; i++)  {lmost[i] = min(lmost[i-1],p[i]); rmost[i] = max(rmost[i-1],p[i]);}
    tie(l,r) = extend(l,r,lmost,rmost);

    long long distFree=0, rMoves=0, lMoves=0;

    while(start<l || r<end) {
        int l2, r2;
        if(r<end && (l<=start || rMoves < lMoves)) {
            r++; rMoves++;
            tie(l2,r2) = extend(l,r,lmost,rmost);
            if (l2<l) {distFree += rMoves; rMoves = lMoves = 0;}
        }
        else {
            l--; lMoves++;
            tie(l2,r2) = extend(l,r,lmost,rmost);
            if (r<r2) {distFree += lMoves; rMoves = lMoves = 0;}
        }
        l = l2; r = r2;
    }
    distFree += rMoves + lMoves;
    return distFree*2+distBooks;
}

long long subtask3(vector<int>& p, int s = 0, int e = -1 , int dir = 1) {
    int n = p.size(), last = s;
    if (e==-1) e = n-1;
    long long total = 0;

    for(int i=s; dir==1 && i<=e || dir==-1 && i>=e; i += dir) {
        if (i==p[i]) continue;
        if (dir*(i-last) > 0) total += abs(i-last)*2;
        total += abs(p[i]-i);
        last = dir==1? max(last,p[i]):min(last,p[i]);
    }
	return total;
}

long long cal(vector<int>& p, int l, int r, int lmost, int rmost, vector<vector<long long>>& dp) {
    if (dp[l][r]!=LLONG_MAX) return dp[l][r];
    int n = p.size(); 
    long long temp1=LLONG_MAX, temp2=LLONG_MAX;
    if (l>0) {
        temp1 = abs(p[l-1]-(l-1)); if(l-1 < lmost) temp1 += 2;
        int lmostN = min(lmost,min(l-1,p[l-1])), rmostN = max(rmost,p[l-1]);
        temp1 += cal(p,l-1,r,lmostN,rmostN,dp); 
    }
    if (r<n-1) {
        temp2 = abs(p[r+1]-(r+1)); if(r+1 > rmost) temp2 += 2;
        int lmostN = min(lmost,p[r+1]), rmostN = max(rmost,max(r+1,p[r+1]));
        temp2 += cal(p,l,r+1,lmostN,rmostN,dp); 
    }
    dp[l][r] = min(temp1,temp2);
    return dp[l][r];
}

long long subtask4(vector<int>& p, int s) {
    int n = p.size();
    
    int start; for(start = 0; start < s; start++) if(start!=p[start]) break;
    int end; for(end = n-1; end > s; end--) if(end!=p[end]) break;
    for(int i = 0; i <= end-start; i++) p[i] = p[i+start]-start;
    s -= start; n = end-start+1; p.resize(n); 

    vector<vector<long long>> dp(n,vector<long long>(n,LLONG_MAX));
    dp[0][n-1]=0;

    int l=s, r=s, lmost = min(s,p[s]), rmost = max(s,p[s]);
    return cal(p,l,r,lmost,rmost,dp)+abs(p[s]-s);
}

long long minimum_walk(std::vector<int> p, int s) {
    if (isSubtask3(s)) return subtask3(p);
    if (isSubtask4(s)) return subtask4(p,s);
    return fulltask(p,s);
}

Compilation message

books.cpp: In function 'long long int subtask3(std::vector<int>&, int, int, int)':
books.cpp:61:25: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   61 |     for(int i=s; dir==1 && i<=e || dir==-1 && i>=e; i += dir) {
      |                  ~~~~~~~^~~~~~~

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 600 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 344 KB Output is correct
9 Correct 1 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 420 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 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 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 600 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 344 KB Output is correct
9 Correct 1 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 420 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 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 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 424 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 424 KB Output is correct
26 Correct 1 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 0 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 600 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 344 KB Output is correct
9 Correct 1 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 420 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 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 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 424 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 424 KB Output is correct
26 Correct 1 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 0 ms 348 KB Output is correct
30 Correct 86 ms 14948 KB Output is correct
31 Correct 84 ms 14816 KB Output is correct
32 Correct 80 ms 14928 KB Output is correct
33 Correct 78 ms 14892 KB Output is correct
34 Correct 80 ms 14808 KB Output is correct
35 Correct 79 ms 14928 KB Output is correct
36 Correct 78 ms 14932 KB Output is correct
37 Correct 77 ms 14928 KB Output is correct
38 Correct 77 ms 15056 KB Output is correct
39 Correct 75 ms 14932 KB Output is correct
40 Correct 77 ms 14800 KB Output is correct
41 Correct 75 ms 14892 KB Output is correct
42 Correct 84 ms 14932 KB Output is correct
43 Correct 79 ms 14804 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8284 KB Output is correct
2 Correct 4 ms 8284 KB Output is correct
3 Correct 7 ms 8284 KB Output is correct
4 Correct 7 ms 8028 KB Output is correct
5 Correct 9 ms 8284 KB Output is correct
6 Correct 8 ms 8284 KB Output is correct
7 Correct 7 ms 8284 KB Output is correct
8 Correct 7 ms 8200 KB Output is correct
9 Correct 7 ms 8284 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 8 ms 8400 KB Output is correct
12 Correct 8 ms 8180 KB Output is correct
13 Correct 7 ms 8284 KB Output is correct
14 Correct 10 ms 8396 KB Output is correct
15 Correct 7 ms 8284 KB Output is correct
16 Correct 7 ms 8400 KB Output is correct
17 Correct 7 ms 8284 KB Output is correct
18 Correct 7 ms 8284 KB Output is correct
19 Correct 7 ms 8284 KB Output is correct
20 Correct 6 ms 8284 KB Output is correct

Subtask #5
30.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 600 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 344 KB Output is correct
9 Correct 1 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 420 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 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 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 424 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 424 KB Output is correct
26 Correct 1 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 0 ms 348 KB Output is correct
30 Correct 86 ms 14948 KB Output is correct
31 Correct 84 ms 14816 KB Output is correct
32 Correct 80 ms 14928 KB Output is correct
33 Correct 78 ms 14892 KB Output is correct
34 Correct 80 ms 14808 KB Output is correct
35 Correct 79 ms 14928 KB Output is correct
36 Correct 78 ms 14932 KB Output is correct
37 Correct 77 ms 14928 KB Output is correct
38 Correct 77 ms 15056 KB Output is correct
39 Correct 75 ms 14932 KB Output is correct
40 Correct 77 ms 14800 KB Output is correct
41 Correct 75 ms 14892 KB Output is correct
42 Correct 84 ms 14932 KB Output is correct
43 Correct 79 ms 14804 KB Output is correct
44 Correct 7 ms 8284 KB Output is correct
45 Correct 4 ms 8284 KB Output is correct
46 Correct 7 ms 8284 KB Output is correct
47 Correct 7 ms 8028 KB Output is correct
48 Correct 9 ms 8284 KB Output is correct
49 Correct 8 ms 8284 KB Output is correct
50 Correct 7 ms 8284 KB Output is correct
51 Correct 7 ms 8200 KB Output is correct
52 Correct 7 ms 8284 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 8 ms 8400 KB Output is correct
55 Correct 8 ms 8180 KB Output is correct
56 Correct 7 ms 8284 KB Output is correct
57 Correct 10 ms 8396 KB Output is correct
58 Correct 7 ms 8284 KB Output is correct
59 Correct 7 ms 8400 KB Output is correct
60 Correct 7 ms 8284 KB Output is correct
61 Correct 7 ms 8284 KB Output is correct
62 Correct 7 ms 8284 KB Output is correct
63 Correct 6 ms 8284 KB Output is correct
64 Correct 82 ms 22628 KB Output is correct
65 Correct 83 ms 22612 KB Output is correct
66 Correct 98 ms 22740 KB Output is correct
67 Correct 95 ms 22608 KB Output is correct
68 Correct 9 ms 2392 KB Output is correct
69 Correct 9 ms 2396 KB Output is correct
70 Correct 8 ms 2396 KB Output is correct
71 Correct 8 ms 2396 KB Output is correct
72 Correct 8 ms 2396 KB Output is correct
73 Correct 9 ms 2396 KB Output is correct
74 Correct 103 ms 22612 KB Output is correct
75 Correct 86 ms 22876 KB Output is correct
76 Correct 83 ms 22616 KB Output is correct
77 Correct 87 ms 22612 KB Output is correct
78 Correct 107 ms 22608 KB Output is correct
79 Correct 83 ms 22608 KB Output is correct
80 Correct 78 ms 22612 KB Output is correct
81 Correct 85 ms 22612 KB Output is correct
82 Correct 89 ms 22880 KB Output is correct
83 Correct 84 ms 22612 KB Output is correct
84 Correct 84 ms 22612 KB Output is correct
85 Correct 86 ms 22608 KB Output is correct
86 Correct 86 ms 22864 KB Output is correct
87 Correct 92 ms 22616 KB Output is correct
88 Correct 86 ms 22568 KB Output is correct
89 Correct 101 ms 22608 KB Output is correct
90 Correct 82 ms 22704 KB Output is correct
91 Correct 88 ms 22740 KB Output is correct
92 Correct 87 ms 22608 KB Output is correct