oj.uz

Submission #866173

# Submission time Handle Problem Language Result Execution time Memory
866173 2023-10-25T14:19:00 Z andrei_boaca Comparing Plants (IOI20_plants) C++17
19 / 100
 4000 ms 20756 KB 
#include "plants.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
typedef long long ll;
vector<int> muchii[200005];
int n,bigger[200005],smaller[200005],lastsmall[200005],lastbig[200005],k,v[200005];
bool use[200005];
ll mars[500005],can[500005];
int dist(int a,int b)
{
    return (b-a+n)%n;
}
int myprv(int x)
{
    return (x-1+n)%n;
}
void init(int K, std::vector<int> r)
{
    n=r.size();
    k=K;
    for(int i=0;i<n;i++)
    {
        lastbig[i]=-1;
        lastsmall[i]=-1;
    }
    for(int i=0;i<n;i++)
    {
        if(r[i]==0)
        {
            int j=(i-1+n)%n;
            while(r[j]==1)
            {
                lastsmall[j]=i;
                j=(j-1+n)%n;
            }
        }
        if(r[i]==1)
        {
            int j=(i-1+n)%n;
            while(r[j]==0)
            {
                lastbig[j]=i;
                j=(j-1+n)%n;
            }
        }
    }
    if(k>2)
    {
        for(int value=1;value<=n;value++)
        {
            for(int i=0;i<=2*n;i++)
            {
                mars[i]=0;
                can[i]=0;
            }
            for(int j=0;j<n;j++)
                if(!use[j])
                {
                    if(r[j]==k-1)
                    {
                        mars[j+1]++;
                        mars[j+k]--;
                    }
                    else
                        can[j]++;
                }
            bool ok=0;
            if(value==2)
                ok=1;
            for(int j=0;j<2*n;j++)
            {
                if(j>0)
                    mars[j]+=mars[j-1];
                can[j%n]+=mars[j];
            }
            int who=-1;
            for(int j=0;j<n;j++)
                if(can[j]==0&&!use[j])
                {
                    who=j;
                    break;
                }
            assert(who>-1);
            use[who]=1;
            v[who]=value;
            for(int j=myprv(who),cnt=1;cnt<k;cnt++,j=myprv(j))
                r[j]++;
        }
    }
}
int compare_plants(int x, int y)
{
    if(k==2)
    {
        if(lastsmall[x]!=-1&&dist(x,y)+dist(y,lastsmall[x])==dist(x,lastsmall[x]))
            return -1;
        if(lastbig[x]!=-1&&dist(x,y)+dist(y,lastbig[x])==dist(x,lastbig[x]))
            return 1;
        if(lastsmall[y]!=-1&&dist(y,x)+dist(x,lastsmall[y])==dist(y,lastsmall[y]))
            return 1;
        if(lastbig[y]!=-1&&dist(y,x)+dist(x,lastbig[y])==dist(y,lastbig[y]))
            return -1;
        return 0;
    }
    if(v[x]<v[y])
        return -1;
    if(v[x]>v[y])
        return 1;
    return 0;
}

Compilation message

plants.cpp: In function 'void init(int, std::vector<int>)':
plants.cpp:68:18: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
   68 |             bool ok=0;
      |                  ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 44 ms 11304 KB Output is correct
7 Correct 48 ms 11604 KB Output is correct
8 Correct 64 ms 15392 KB Output is correct
9 Correct 62 ms 15516 KB Output is correct
10 Correct 62 ms 15444 KB Output is correct
11 Correct 63 ms 15404 KB Output is correct
12 Correct 70 ms 15440 KB Output is correct
13 Correct 59 ms 15452 KB Output is correct
14 Correct 59 ms 15512 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 2 ms 10588 KB Output is correct
5 Correct 2 ms 10588 KB Output is correct
6 Correct 18 ms 10840 KB Output is correct
7 Correct 406 ms 13492 KB Output is correct
8 Correct 3 ms 10588 KB Output is correct
9 Correct 17 ms 10836 KB Output is correct
10 Correct 398 ms 13496 KB Output is correct
11 Correct 349 ms 13616 KB Output is correct
12 Correct 345 ms 13632 KB Output is correct
13 Correct 422 ms 13500 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 2 ms 10588 KB Output is correct
5 Correct 2 ms 10588 KB Output is correct
6 Correct 18 ms 10840 KB Output is correct
7 Correct 406 ms 13492 KB Output is correct
8 Correct 3 ms 10588 KB Output is correct
9 Correct 17 ms 10836 KB Output is correct
10 Correct 398 ms 13496 KB Output is correct
11 Correct 349 ms 13616 KB Output is correct
12 Correct 345 ms 13632 KB Output is correct
13 Correct 422 ms 13500 KB Output is correct
14 Execution timed out 4026 ms 15444 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 84 ms 13424 KB Output is correct
4 Execution timed out 4017 ms 20756 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 2 ms 10588 KB Output is correct
5 Incorrect 2 ms 10588 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8792 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Incorrect 2 ms 10588 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 44 ms 11304 KB Output is correct
7 Correct 48 ms 11604 KB Output is correct
8 Correct 64 ms 15392 KB Output is correct
9 Correct 62 ms 15516 KB Output is correct
10 Correct 62 ms 15444 KB Output is correct
11 Correct 63 ms 15404 KB Output is correct
12 Correct 70 ms 15440 KB Output is correct
13 Correct 59 ms 15452 KB Output is correct
14 Correct 59 ms 15512 KB Output is correct
15 Correct 1 ms 8536 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 2 ms 10588 KB Output is correct
18 Correct 2 ms 10588 KB Output is correct
19 Correct 2 ms 10588 KB Output is correct
20 Correct 18 ms 10840 KB Output is correct
21 Correct 406 ms 13492 KB Output is correct
22 Correct 3 ms 10588 KB Output is correct
23 Correct 17 ms 10836 KB Output is correct
24 Correct 398 ms 13496 KB Output is correct
25 Correct 349 ms 13616 KB Output is correct
26 Correct 345 ms 13632 KB Output is correct
27 Correct 422 ms 13500 KB Output is correct
28 Execution timed out 4026 ms 15444 KB Time limit exceeded
29 Halted 0 ms 0 KB -