oj.uz

답안 #304016

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
304016 2020-09-21T00:35:08 Z daniel920712 식물 비교 (IOI20_plants) C++14
19 / 100
 4000 ms 27148 KB 
#include "plants.h"
#include <stdio.h>
#include <vector>
#include <utility>
#include <set>
using namespace std;
vector < int > all;
vector < int > Next[200005];
vector < pair < int , int > > con[200005];
int N,tt=0;
bool use[2000005]={0};
int Con[200005];
int what[200005];
int now=1;
struct A
{
    int l,r;
    int nxl,nxr;
    int small1,small2;
    int add1,add2;
}Node[2000005];
void build(int l,int r,int here)
{
    Node[here].l=l;
    Node[here].r=r;
    Node[here].add1=0;
    Node[here].add2=0;
    Node[here].small1=0;
    if(l==r)
    {
        Node[here].small2=all[l];
        return ;
    }
    Node[here].nxl=now++;
    Node[here].nxr=now++;
    build(l,(l+r)/2,Node[here].nxl);
    build((l+r)/2+1,r,Node[here].nxr);
    Node[here].small2=min(Node[Node[here].nxl].small2,Node[Node[here].nxr].small2);
    Node[here].small1=min(Node[Node[here].nxl].small1,Node[Node[here].nxr].small1);
}
void UPD(int here)
{
    Node[Node[here].nxl].add1+=Node[here].add1;
    Node[Node[here].nxl].small1+=Node[here].add1;
    Node[Node[here].nxr].add1+=Node[here].add1;
    Node[Node[here].nxr].small1+=Node[here].add1;
    Node[here].add1=0;
}
void cha1(int l,int r,int con,int here)
{
    if(l>r) return ;
    if(l==Node[here].l&&r==Node[here].r)
    {
        Node[here].add1+=con;
        Node[here].small1+=con;
        return;
    }
    UPD(here);
    if(r<=(Node[here].l+Node[here].r)/2) cha1(l,r,con,Node[here].nxl);
    else if(l>(Node[here].l+Node[here].r)/2) cha1(l,r,con,Node[here].nxr);
    else
    {
        cha1(l,(Node[here].l+Node[here].r)/2,con,Node[here].nxl);
        cha1((Node[here].l+Node[here].r)/2+1,r,con,Node[here].nxr);
    }
    Node[here].small2=min(Node[Node[here].nxl].small2,Node[Node[here].nxr].small2);
    Node[here].small1=min(Node[Node[here].nxl].small1,Node[Node[here].nxr].small1);
}
int Find(int where,int here)
{
    if(Node[here].l==where&&Node[here].r==where) return Node[here].small1;
    UPD(here);
    if(where<=(Node[here].l+Node[here].r)/2) return Find(where,Node[here].nxl);
    else return Find(where,Node[here].nxr);
}
void init(int k,vector<int> r)
{
    int a=0,b=0,i,j,ok=0,l,t,t2,x;
    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));
                }
            }
        }
        else
        {
            build(0,N-1,0);
            for(i=0;i<N;i++)
            {
                if(r[i]==0)
                {
                    t=(i+k-1)%N;
                    //printf("cc %d %d\n",i+1,t);
                    if(t>=i) cha1(i+1,t,1,0);
                    else
                    {
                        cha1(i+1,N-1,1,0);
                        cha1(0,t,1,0);
                    }
                }
            }
            for(i=0;i<N;i++)
            {
                for(j=0;j<N;j++)
                {
                    if(use[j]==0&&Find(j,0)==0&&r[j]==0)
                    {
                        x=j;
                        break;
                    }
                }
                //printf("aa %d\n",x);
                what[x]=i;
                use[x]=1;
                t=(x+k-1)%N;
                //printf("bb %d %d\n",x+1,t);
                if(t>=x) cha1(x+1,t,-1,0);
                else
                {
                    cha1(x+1,N-1,-1,0);
                    cha1(0,t,-1,0);
                }
                for(j=1;j<k;j++)
                {
                    t=(x-j+2*N)%N;
                    r[t]--;
                    if(r[t]==0&&use[t]==0)
                    {
                        t2=(t+k-1)%N;
                        //printf("cc %d %d\n",t+1,t2);
                        if(t2>=t) cha1(t+1,t2,1,0);
                        else
                        {
                            cha1(t+1,N-1,1,0);
                            cha1(0,t2,1,0);
                        }
                    }
                }

            }
        }
    }
	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
    {
        if(what[x]<what[y]) return 1;
        else return -1;
    }

	return 0;
}

Compilation message

plants.cpp: In function 'void init(int, std::vector<int>)':
plants.cpp:78:21: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
   78 |     int a=0,b=0,i,j,ok=0,l,t,t2,x;
      |                     ^~
plants.cpp:78:26: warning: unused variable 'l' [-Wunused-variable]
   78 |     int a=0,b=0,i,j,ok=0,l,t,t2,x;
      |                          ^
plants.cpp: In function 'int compare_plants(int, int)':
plants.cpp:170:9: warning: unused variable 'i' [-Wunused-variable]
  170 |     int i;
      |         ^
plants.cpp: In function 'void init(int, std::vector<int>)':
plants.cpp:78:33: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
   78 |     int a=0,b=0,i,j,ok=0,l,t,t2,x;
      |                                 ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 7 ms 9728 KB Output is correct
4 Correct 7 ms 9728 KB Output is correct
5 Correct 7 ms 9728 KB Output is correct
6 Correct 74 ms 12536 KB Output is correct
7 Correct 90 ms 13436 KB Output is correct
8 Correct 144 ms 20728 KB Output is correct
9 Correct 138 ms 20728 KB Output is correct
10 Correct 142 ms 20728 KB Output is correct
11 Correct 138 ms 20728 KB Output is correct
12 Correct 138 ms 20728 KB Output is correct
13 Correct 145 ms 20728 KB Output is correct
14 Correct 138 ms 20676 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 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 Correct 7 ms 9728 KB Output is correct
5 Correct 7 ms 9728 KB Output is correct
6 Correct 49 ms 9976 KB Output is correct
7 Correct 1280 ms 13300 KB Output is correct
8 Correct 9 ms 9856 KB Output is correct
9 Correct 49 ms 9856 KB Output is correct
10 Correct 1292 ms 13044 KB Output is correct
11 Correct 197 ms 12920 KB Output is correct
12 Correct 2184 ms 13188 KB Output is correct
13 Correct 1329 ms 13048 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 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 Correct 7 ms 9728 KB Output is correct
5 Correct 7 ms 9728 KB Output is correct
6 Correct 49 ms 9976 KB Output is correct
7 Correct 1280 ms 13300 KB Output is correct
8 Correct 9 ms 9856 KB Output is correct
9 Correct 49 ms 9856 KB Output is correct
10 Correct 1292 ms 13044 KB Output is correct
11 Correct 197 ms 12920 KB Output is correct
12 Correct 2184 ms 13188 KB Output is correct
13 Correct 1329 ms 13048 KB Output is correct
14 Execution timed out 4062 ms 13696 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 160 ms 12664 KB Output is correct
4 Execution timed out 4009 ms 27148 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 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 Correct 7 ms 9728 KB Output is correct
5 Incorrect 7 ms 9856 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 8 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

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 7 ms 9728 KB Output is correct
4 Correct 7 ms 9728 KB Output is correct
5 Correct 7 ms 9728 KB Output is correct
6 Correct 74 ms 12536 KB Output is correct
7 Correct 90 ms 13436 KB Output is correct
8 Correct 144 ms 20728 KB Output is correct
9 Correct 138 ms 20728 KB Output is correct
10 Correct 142 ms 20728 KB Output is correct
11 Correct 138 ms 20728 KB Output is correct
12 Correct 138 ms 20728 KB Output is correct
13 Correct 145 ms 20728 KB Output is correct
14 Correct 138 ms 20676 KB Output is correct
15 Correct 7 ms 9728 KB Output is correct
16 Correct 7 ms 9728 KB Output is correct
17 Correct 7 ms 9728 KB Output is correct
18 Correct 7 ms 9728 KB Output is correct
19 Correct 7 ms 9728 KB Output is correct
20 Correct 49 ms 9976 KB Output is correct
21 Correct 1280 ms 13300 KB Output is correct
22 Correct 9 ms 9856 KB Output is correct
23 Correct 49 ms 9856 KB Output is correct
24 Correct 1292 ms 13044 KB Output is correct
25 Correct 197 ms 12920 KB Output is correct
26 Correct 2184 ms 13188 KB Output is correct
27 Correct 1329 ms 13048 KB Output is correct
28 Execution timed out 4062 ms 13696 KB Time limit exceeded
29 Halted 0 ms 0 KB -