oj.uz

Submission #1077018

# Submission time Handle Problem Language Result Execution time Memory
1077018 2024-08-26T20:56:06 Z lucri Tortoise (CEOI21_tortoise) C++17
73 / 100
 125 ms 712 KB 
#include <bits/stdc++.h>
using namespace std;
long long cost,n,v[10020],l[10020],r[10020],jump[10020],nr;
priority_queue<pair<int,int>>q;
bool candy(int time,int poz)
{
    bool ok=false;
    for(int i=poz;v[i]!=-1;++i)
        if(v[i]||jump[i])
            ok=true;
    if(ok==false)
        return true;
    for(int i=poz;v[i]!=-1;++i)
        if(v[i]&&time+i-poz<=(i-1)*2)
            return true;
    return false;
}
bool ok()
{
    int time=0;
    if(candy(0,1)==false)
        return false;
    time=r[1]-1;
    for(int i=1;i<=n;++i)
    {
        if(v[i]==-1)
        {
            if(v[i-1]==-1)
                ++time;
            continue;
        }
        if(r[i]-i==i-l[i]||r[i]-i==(i-1)-l[i])
        {
            if(candy(time-(i-1-l[i])+1,l[i]+1)==false)
                return false;
            time+=r[i]-(i-1);
        }
        if(r[i]-i<=i-l[i])
        {
            for(int j=1;j<=jump[i];++j)
            {
                if(time+r[i]-i>2*(i-1))
                    return false;
                time+=2*(r[i]-i);
            }
        }
        else
        {
            ++time;
            for(int j=1;j<=jump[i];++j)
            {
                if(time>2*(i-1))
                    return false;
                time+=2*(i-l[i]);
            }
        }
    }
    if(candy(time-(n-l[n])+1,l[n]+1)==false)
        return false;
    return true;
}
int main()
{
    cin>>n;
    for(int i=1;i<=n;++i)
        cin>>v[i];
    v[10010]=-1;
    l[0]=-10010;
    r[n+1]=10010;
    for(int i=1;i<=n;++i)
    {
        l[i]=l[i-1];
        if(v[i]==-1)
            l[i]=i;
    }
    for(int i=n;i>=1;--i)
    {
        r[i]=r[i+1];
        if(v[i]==-1)
            r[i]=i;
    }
    for(int i=1;i<=n;++i)
        q.push({-min(r[i]-i,i-l[i]),i});
    while(!q.empty())
    {
        int ind=q.top().second;
        q.pop();
        if(v[ind]==-1)
            continue;
        while(v[ind])
        {
            --v[ind];
            ++jump[ind];
            if(ok()==false)
            {
                ++v[ind];
                --jump[ind];
                break;
            }
        }
    }
    for(int i=1;i<=10010;++i)
        if(v[i]!=-1)
            nr+=v[i];
        else
        {
            if(nr)
                --cost;
            nr=0;
        }
    for(int i=1;i<=n;++i)
        if(v[i]!=-1)
            cost+=v[i];
    cout<<cost;
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 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 348 KB Output is correct
7 Correct 0 ms 456 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 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 348 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 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 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 400 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 444 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 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 348 KB Output is correct
7 Correct 0 ms 456 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 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 348 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 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 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 400 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 444 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 ms 348 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 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 348 KB Output is correct
7 Correct 0 ms 456 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 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 348 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 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 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 400 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 444 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 464 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 2 ms 348 KB Output is correct
51 Correct 2 ms 472 KB Output is correct
52 Correct 1 ms 460 KB Output is correct
53 Correct 2 ms 348 KB Output is correct
54 Correct 3 ms 344 KB Output is correct
55 Correct 2 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 1 ms 600 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 2 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 1 ms 348 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 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 348 KB Output is correct
7 Correct 0 ms 456 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 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 348 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 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 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 400 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 444 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 464 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 2 ms 348 KB Output is correct
51 Correct 2 ms 472 KB Output is correct
52 Correct 1 ms 460 KB Output is correct
53 Correct 2 ms 348 KB Output is correct
54 Correct 3 ms 344 KB Output is correct
55 Correct 2 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 1 ms 600 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 2 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 25 ms 604 KB Output is correct
64 Correct 86 ms 692 KB Output is correct
65 Correct 47 ms 600 KB Output is correct
66 Correct 66 ms 708 KB Output is correct
67 Correct 50 ms 600 KB Output is correct
68 Correct 52 ms 604 KB Output is correct
69 Correct 62 ms 704 KB Output is correct
70 Correct 64 ms 604 KB Output is correct
71 Correct 125 ms 600 KB Output is correct
72 Correct 119 ms 668 KB Output is correct
73 Correct 116 ms 696 KB Output is correct
74 Correct 125 ms 712 KB Output is correct
75 Correct 2 ms 604 KB Output is correct
76 Correct 77 ms 700 KB Output is correct
77 Correct 73 ms 604 KB Output is correct
78 Correct 72 ms 708 KB Output is correct
79 Correct 75 ms 700 KB Output is correct
80 Correct 64 ms 600 KB Output is correct
81 Correct 75 ms 604 KB Output is correct
82 Correct 70 ms 600 KB Output is correct
83 Correct 91 ms 696 KB Output is correct
84 Correct 100 ms 676 KB Output is correct
85 Correct 107 ms 604 KB Output is correct
86 Correct 100 ms 600 KB Output is correct
87 Correct 108 ms 692 KB Output is correct
88 Correct 98 ms 600 KB Output is correct

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 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 348 KB Output is correct
7 Correct 0 ms 456 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 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 348 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 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 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 400 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 444 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 464 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 2 ms 348 KB Output is correct
51 Correct 2 ms 472 KB Output is correct
52 Correct 1 ms 460 KB Output is correct
53 Correct 2 ms 348 KB Output is correct
54 Correct 3 ms 344 KB Output is correct
55 Correct 2 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 1 ms 600 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 2 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 25 ms 604 KB Output is correct
64 Correct 86 ms 692 KB Output is correct
65 Correct 47 ms 600 KB Output is correct
66 Correct 66 ms 708 KB Output is correct
67 Correct 50 ms 600 KB Output is correct
68 Correct 52 ms 604 KB Output is correct
69 Correct 62 ms 704 KB Output is correct
70 Correct 64 ms 604 KB Output is correct
71 Correct 125 ms 600 KB Output is correct
72 Correct 119 ms 668 KB Output is correct
73 Correct 116 ms 696 KB Output is correct
74 Correct 125 ms 712 KB Output is correct
75 Correct 2 ms 604 KB Output is correct
76 Correct 77 ms 700 KB Output is correct
77 Correct 73 ms 604 KB Output is correct
78 Correct 72 ms 708 KB Output is correct
79 Correct 75 ms 700 KB Output is correct
80 Correct 64 ms 600 KB Output is correct
81 Correct 75 ms 604 KB Output is correct
82 Correct 70 ms 600 KB Output is correct
83 Correct 91 ms 696 KB Output is correct
84 Correct 100 ms 676 KB Output is correct
85 Correct 107 ms 604 KB Output is correct
86 Correct 100 ms 600 KB Output is correct
87 Correct 108 ms 692 KB Output is correct
88 Correct 98 ms 600 KB Output is correct
89 Incorrect 2 ms 600 KB Output isn't correct
90 Halted 0 ms 0 KB -