oj.uz

Submission #915999

# Submission time Handle Problem Language Result Execution time Memory
915999 2024-01-25T05:47:30 Z nightfal Ancient Books (IOI17_books) C++14
50 / 100
 103 ms 15888 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;}

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();
    // long long move = 0;
    
    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);
}

tuple<int,int,long long> extend(vector<int> p, int l, int r, int lmost, int rmost, int move) {
    int n = p.size();
    while(l> lmost || r < rmost) {
        int idx;
        if (l > max(lmost,0)) idx == --l;
        else if (r < min(rmost,n-1)) idx == ++r;
        move += abs(p[idx]-idx);
        lmost = min(lmost,p[idx]); 
        rmost = max(rmost,p[idx]);
    }
    return make_tuple(l,r,move);
} 

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;
    for(int i = 0; i <= end-start; i++) p[i] = p[i+start]-start;
    s -= start; n = end-start+1; p.resize(n); 

    int l=s, r=s, lmost = min(s,p[s]), rmost = max(s,p[s]);
    long long total=abs(p[s]-s), sumL=0, sumR=0, moveL=0, moveR=0;
    

    while(0<l || r<n-1) {
        // printf("total=%d, sumL=%d, sumR=%d, moveL=%d, moveR=%d\n",total,sumL,sumR,moveL,moveR);
        // printf("l=%d, r=%d, lmost=%d, rmost=%d\n\n",l,r,lmost,rmost);

        if(r < n-1 && (l <= 0 || moveR < moveL || moveR == moveL && r < rmost)) {
            if(rmost <= r) moveR++;
            r++;
            sumR += abs(p[r]-r);
            rmost = max(rmost,max(r,p[r]));
            lmost  = min(lmost,p[r]);
            if (lmost <= l) {moveL = 0; total+=sumR+moveR*2; moveR=0; sumR=0;}
        } 
        else if(0 < l && (r >= n-1 || moveR > moveL || moveR == moveL && r >= rmost)) {
            if (l <= lmost) moveL++;
            l--;
            sumL += abs(p[l]-l); 
            lmost  = min(lmost,min(l,p[l]));
            rmost = max(rmost,p[l]);
            if (r <= rmost) {moveR = 0; total+=sumL+moveL*2; moveL=0; sumL=0;}            
            l--;
        }
    }
    // printf("total=%d, sumL=%d, sumR=%d, moveL=%d, moveR=%d\n",total,sumL,sumR,moveL,moveR);
    // printf("l=%d, r=%d, lmost=%d, rmost=%d\n",l,r,lmost,rmost);
 
    if(sumL) total += sumL + moveL; // ??
    if(sumR) total += sumR + moveR; // ??
    return total;
}

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:18:25: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   18 |     for(int i=s; dir==1 && i<=e || dir==-1 && i>=e; i += dir) {
      |                  ~~~~~~~^~~~~~~
books.cpp: In function 'std::tuple<int, int, long long int> extend(std::vector<int>, int, int, int, int, int)':
books.cpp:64:35: warning: value computed is not used [-Wunused-value]
   64 |         if (l > max(lmost,0)) idx == --l;
      |                               ~~~~^~~~~~
books.cpp:65:42: warning: value computed is not used [-Wunused-value]
   65 |         else if (r < min(rmost,n-1)) idx == ++r;
      |                                      ~~~~^~~~~~
books.cpp: In function 'long long int fulltask(std::vector<int>, int)':
books.cpp:90:66: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   90 |         if(r < n-1 && (l <= 0 || moveR < moveL || moveR == moveL && r < rmost)) {
      |                                                   ~~~~~~~~~~~~~~~^~~~~~~~~~~~
books.cpp:98:71: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   98 |         else if(0 < l && (r >= n-1 || moveR > moveL || moveR == moveL && r >= rmost)) {
      |                                                        ~~~~~~~~~~~~~~~^~~~~~~~~~~~~
books.cpp: In function 'std::tuple<int, int, long long int> extend(std::vector<int>, int, int, int, int, int)':
books.cpp:66:26: warning: 'idx' is used uninitialized in this function [-Wuninitialized]
   66 |         move += abs(p[idx]-idx);
      |                          ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 612 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 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

# Verdict Execution time Memory Grader output
1 Correct 0 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 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 612 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 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 600 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 424 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 612 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 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 600 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 424 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 90 ms 15700 KB Output is correct
31 Correct 83 ms 15824 KB Output is correct
32 Correct 98 ms 15684 KB Output is correct
33 Correct 77 ms 15592 KB Output is correct
34 Correct 81 ms 15696 KB Output is correct
35 Correct 99 ms 15592 KB Output is correct
36 Correct 101 ms 15792 KB Output is correct
37 Correct 86 ms 15888 KB Output is correct
38 Correct 103 ms 15628 KB Output is correct
39 Correct 98 ms 15588 KB Output is correct
40 Correct 92 ms 15512 KB Output is correct
41 Correct 78 ms 15568 KB Output is correct
42 Correct 78 ms 15584 KB Output is correct
43 Correct 76 ms 15584 KB Output is correct

Subtask #4
0 / 20.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 612 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 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 600 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 424 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 90 ms 15700 KB Output is correct
31 Correct 83 ms 15824 KB Output is correct
32 Correct 98 ms 15684 KB Output is correct
33 Correct 77 ms 15592 KB Output is correct
34 Correct 81 ms 15696 KB Output is correct
35 Correct 99 ms 15592 KB Output is correct
36 Correct 101 ms 15792 KB Output is correct
37 Correct 86 ms 15888 KB Output is correct
38 Correct 103 ms 15628 KB Output is correct
39 Correct 98 ms 15588 KB Output is correct
40 Correct 92 ms 15512 KB Output is correct
41 Correct 78 ms 15568 KB Output is correct
42 Correct 78 ms 15584 KB Output is correct
43 Correct 76 ms 15584 KB Output is correct
44 Incorrect 0 ms 604 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2962'
45 Halted 0 ms 0 KB -