oj.uz

Submission #300546

# Submission time Handle Problem Language Result Execution time Memory
300546 2020-09-17T09:12:27 Z daniel920712 Comparing Plants (IOI20_plants) C++14
5 / 100
 3083 ms 26872 KB 
#include "plants.h"
#include <stdio.h>
#include <vector>
#include <utility>
using namespace std;
vector < pair < int , int > > con[200005];
vector < int > all;
vector < int > Next[200005];
int N,tt=0;
bool use[2000005];
void init(int k,vector<int> r)
{
    int a=0,b=0,i,j,ok=0;
    all=r;
    N=r.size();
    if(k==2) tt=1;
    for(i=0;i<N;i++)
    {
        if(k==2)
        {
            if(r[(i+N-1)%N]!=r[i])
            {
                b=0;
                a++;

                con[i].push_back(make_pair(a,0));
                for(j=(i+1)%N;r[(j+N-1)%N]==r[i];j=(j+1)%N)
                {
                    if(j==N-1) ok=1;
                    if(r[i]==0) b--;
                    else b++;
                    con[j].push_back(make_pair(a,b));
                }
            }
        }
        if(r[i]==k-1) for(j=1;j<k;j++) Next[j].push_back((j+1)%N);
        if(r[i]==0) for(j=1;j<k;j++) Next[(j+i)%N].push_back(j);


        if(r[i]>r[(i+1)%N]) Next[i].push_back((i+1)%N);
        if(r[i]<r[(i+1)%N]) Next[(i+1)%N].push_back(i);

    }
	return;
}
bool F(int a,int b)
{
    if(a==b) return 1;
    if(use[a]) return 0;
    use[a]=1;
    for(auto i:Next[a]) if(F(i,b)) return 1;
    return 0;
}
int compare_plants(int x, int y)
{
    int i;
    if(tt)
    {
        for(auto i:con[x])
        {
            for(auto j:con[y])
            {
                if(i.first==j.first)
                {
                    if(i.second<j.second) return -1;
                    return 1;
                }
            }
        }

    }
    else
    {
        for(i=0;i<N;i++) use[i]=0;
        if(F(x,y)) return -1;
        else if(F(y,x)) return 1;
    }

	return 0;
}

Compilation message

plants.cpp: In function 'void init(int, std::vector<int>)':
plants.cpp:13:21: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
   13 |     int a=0,b=0,i,j,ok=0;
      |                     ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 7 ms 9856 KB Output is correct
4 Correct 7 ms 9728 KB Output is correct
5 Correct 7 ms 9728 KB Output is correct
6 Correct 73 ms 12540 KB Output is correct
7 Correct 89 ms 13688 KB Output is correct
8 Correct 148 ms 24432 KB Output is correct
9 Correct 145 ms 24152 KB Output is correct
10 Correct 146 ms 24176 KB Output is correct
11 Correct 141 ms 24564 KB Output is correct
12 Correct 143 ms 24640 KB Output is correct
13 Correct 144 ms 26872 KB Output is correct
14 Correct 138 ms 21872 KB Output is correct

Subtask #2
0 / 14.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Incorrect 3083 ms 12536 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

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

Subtask #6
0 / 15.0

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

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 7 ms 9856 KB Output is correct
4 Correct 7 ms 9728 KB Output is correct
5 Correct 7 ms 9728 KB Output is correct
6 Correct 73 ms 12540 KB Output is correct
7 Correct 89 ms 13688 KB Output is correct
8 Correct 148 ms 24432 KB Output is correct
9 Correct 145 ms 24152 KB Output is correct
10 Correct 146 ms 24176 KB Output is correct
11 Correct 141 ms 24564 KB Output is correct
12 Correct 143 ms 24640 KB Output is correct
13 Correct 144 ms 26872 KB Output is correct
14 Correct 138 ms 21872 KB Output is correct
15 Correct 7 ms 9728 KB Output is correct
16 Correct 7 ms 9728 KB Output is correct
17 Incorrect 7 ms 9728 KB Output isn't correct
18 Halted 0 ms 0 KB -