제출 #850291

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
850291		alexdd	Amusement Park (JOI17_amusement_park)	C++17	83 / 100	20 ms	6360 KiB

Joi

#include "Joi.h"
#include<bits/stdc++.h>
using namespace std;
static bool visited[10005];
static bool visited2[10005];
static vector<int> ord;
static vector<int> con[10005];
static bool done[10005];
static int maxd[10005];
static int siz[10005];
static int parent[10005];
static int subtask;
static bool cmp(int x, int y)
{
    if(siz[x]<siz[y])
        return 1;
    if(siz[x]>siz[y])
        return 0;
    if(maxd[x]<maxd[y])
        return 1;
    if(maxd[x]>maxd[y])
        return 0;
    return x<y;
}
static void dfs_init(int nod)
{
    visited2[nod]=1;
    siz[nod]=1;
    maxd[nod]=1;
    for(auto adj:con[nod])
    {
        if(!visited2[adj])
        {
            parent[adj]=nod;
            dfs_init(adj);
            maxd[nod]=max(maxd[nod],maxd[adj]+1);
            siz[nod]+=siz[adj];
        }
    }
}
static void dfs(int nod)
{
    visited[nod]=1;
    sort(con[nod].begin(),con[nod].end(),cmp);
    ord.push_back(nod);
    for(auto adj:con[nod])
    {
        if(!visited[adj])
        {
            dfs(adj);
            ord.push_back(nod);
        }
    }
}
void Joi(int N, int M, int A[], int B[], long long X, int T)
{
    if(T==5 && N>=240)
        T=4;
    subtask=T;
    ord.clear();
    for(int i=0;i<N;i++)
    {
        visited[i]=0;
        visited2[i]=0;
        con[i].clear();
        done[i]=0;
    }

    for(int i=0;i<M;i++)
    {
        con[A[i]].push_back(B[i]);
        con[B[i]].push_back(A[i]);
    }
    if(T!=5)
    {
        dfs_init(0);
        dfs(0);
    }
    else
    {
        for(int root=0;root<N;root++)
        {
            for(int i=0;i<N;i++)
            {
                visited[i]=0;
                visited2[i]=0;
            }
            dfs_init(root);
            dfs(root);
            if(root+1<N)
            {
                vector<int> cv;
                int cur=root+1;
                while(cur!=root)
                {
                    cv.push_back(cur);
                    cur=parent[cur];
                }
                for(int i=cv.size()-1;i>0;i--)
                {
                    ord.push_back(cv[i]);
                }
            }
        }
    }
    int cnt=0;
    for(int i=0;i<(int)ord.size();i++)
    {
        if(!done[ord[i]])
        {
            if(((1LL<<cnt)&X))
                MessageBoard(ord[i],1);
            else
                MessageBoard(ord[i],0);
            cnt=(cnt+1)%60;
            done[ord[i]]=1;
        }
    }
}

Ioi

#include "Ioi.h"
#include<bits/stdc++.h>
using namespace std;
static const int INF = 1e9;
static bool visited[10005];
static bool visited2[10005];
static vector<int> ord;
static vector<int> con[10005];
static bool done[10005];
static int p[50005];
static vector<int> poz[10005];
static int fr[65];
static int frst[65];
static int frdr[65];
static int care[10005];
static int maxd[10005];
static int siz[10005];
static int parent[10005];
static int subtask;
static bool cmp(int x, int y)
{
    if(siz[x]<siz[y])
        return 1;
    if(siz[x]>siz[y])
        return 0;
    if(maxd[x]<maxd[y])
        return 1;
    if(maxd[x]>maxd[y])
        return 0;
    return x<y;
}
static void dfs_init(int nod)
{
    visited2[nod]=1;
    siz[nod]=1;
    maxd[nod]=1;
    for(auto adj:con[nod])
    {
        if(!visited2[adj])
        {
            parent[adj]=nod;
            dfs_init(adj);
            maxd[nod]=max(maxd[nod],maxd[adj]+1);
            siz[nod]+=siz[adj];
        }
    }
}
static void dfs(int nod)
{
    visited[nod]=1;
    sort(con[nod].begin(),con[nod].end(),cmp);
    poz[nod].push_back(ord.size());
    ord.push_back(nod);
    for(auto adj:con[nod])
    {
        if(!visited[adj])
        {
            dfs(adj);
            poz[nod].push_back(ord.size());
            ord.push_back(nod);
        }
    }
}
static int calc_moves(int init)
{
    for(int i=0;i<60;i++)
    {
        frst[i]=0;
        frdr[i]=0;
    }
    int cntst=0,cntdr=0,pozst,pozdr;
    for(int i=init;i<(int)ord.size();i++)
    {
        if(frdr[p[i]]==0)
        {
            frdr[p[i]]=1;
            cntdr++;
            if(cntdr==60)
            {
                pozdr=i-init;
                break;
            }
        }
    }
    for(int i=init;i>=0;i--)
    {
        if(frst[p[i]]==0)
        {
            frst[p[i]]=1;
            cntst++;
            if(cntst==60)
            {
                pozst=init-i;
                break;
            }
        }
    }
    if((cntdr==60 && cntst<60) || (cntdr==60 && cntst==60 && pozdr<pozst) || (cntdr<60 && cntst<60 && init>ord.size()-init))
    {
        if(cntdr==60)
            return pozdr;
        return 2*((int)ord.size()-init) + init;
    }
    else
    {
        if(cntst==60)
            return pozst;
        return ((int)ord.size()-init) + 2*init;
    }
}
static long long solve(int init, int V)
{
    for(int i=0;i<60;i++)
    {
        frst[i]=0;
        frdr[i]=0;
        fr[i]=0;
    }
    int cntst=0,cntdr=0,pozst,pozdr;
    for(int i=init;i<(int)ord.size();i++)
    {
        if(frdr[p[i]]==0)
        {
            frdr[p[i]]=1;
            cntdr++;
            if(cntdr==60)
            {
                pozdr=i-init;
                break;
            }
        }
    }
    for(int i=init;i>=0;i--)
    {
        if(frst[p[i]]==0)
        {
            frst[p[i]]=1;
            cntst++;
            if(cntst==60)
            {
                pozst=init-i;
                break;
            }
        }
    }
    long long rez=0;
    int cate=0;
    if((cntdr==60 && cntst<60) || (cntdr==60 && cntst==60 && pozdr<pozst) || (cntdr<60 && cntst<60 && init>ord.size()-init))
    {
        for(int i=init;i<(int)ord.size();i++)
        {
            if(fr[p[i]]==0)
            {
                if(V==1) rez += (1LL<<(p[i]));
                fr[p[i]]=1;
                cate++;
                if(cate==60)
                    return rez;
            }
            if(i+1<(int)ord.size()) V = Move(ord[i+1]);
        }
        for(int i=(int)ord.size()-1;i>=0;i--)
        {
            if(fr[p[i]]==0)
            {
                if(V==1) rez += (1LL<<(p[i]));
                fr[p[i]]=1;
                cate++;
                if(cate==60)
                    return rez;
            }
            V = Move(ord[i-1]);
        }
    }
    else
    {
        for(int i=init;i>=0;i--)
        {
            if(fr[p[i]]==0)
            {
                if(V==1) rez += (1LL<<(p[i]));
                fr[p[i]]=1;
                cate++;
                if(cate==60)
                    return rez;
            }
            if(i-1>=0) V = Move(ord[i-1]);
        }
        for(int i=0;i<(int)ord.size();i++)
        {
            if(fr[p[i]]==0)
            {
                if(V==1) rez += (1LL<<(p[i]));
                fr[p[i]]=1;
                cate++;
                if(cate==60)
                    return rez;
            }
            V = Move(ord[i+1]);
        }
    }
    return rez;
}
long long Ioi(int N, int M, int A[], int B[], int P, int V, int T)
{
    if(T==5 && N>=240)
        T=4;
    subtask=T;
    ord.clear();
    for(int i=0;i<N;i++)
    {
        visited[i]=0;
        visited2[i]=0;
        con[i].clear();
        poz[i].clear();
        done[i]=0;
    }

    for(int i=0;i<M;i++)
    {
        con[A[i]].push_back(B[i]);
        con[B[i]].push_back(A[i]);
    }
    if(T!=5)
    {
        dfs_init(0);
        dfs(0);
    }
    else
    {
        for(int root=0;root<N;root++)
        {
            for(int i=0;i<N;i++)
            {
                visited[i]=0;
                visited2[i]=0;
            }
            dfs_init(root);
            dfs(root);
            if(root+1<N)
            {
                vector<int> cv;
                int cur=root+1;
                while(cur!=root)
                {
                    cv.push_back(cur);
                    cur=parent[cur];
                }
                for(int i=cv.size()-1;i>0;i--)
                {
                    ord.push_back(cv[i]);
                }
            }
        }
    }
    int cnt=0;
    for(int i=0;i<(int)ord.size();i++)
    {
        if(!done[ord[i]])
        {
            care[ord[i]]=cnt;
            cnt=(cnt+1)%60;
            done[ord[i]]=1;
        }
        p[i]=care[ord[i]];
        //cout<<i<<" "<<ord[i]<<"  "<<p[i]<<" zzz\n";
    }

    int mnm=INF,idk=-1;
    for(auto x:poz[P])
    {
        int aux = calc_moves(x);
        if(aux<mnm)
        {
            mnm=aux;
            idk=x;
        }
    }
    return solve(idk,V);
}

컴파일 시 표준 에러 (stderr) 메시지

Ioi.cpp: In function 'int calc_moves(int)':
Ioi.cpp:98:107: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |     if((cntdr==60 && cntst<60) || (cntdr==60 && cntst==60 && pozdr<pozst) || (cntdr<60 && cntst<60 && init>ord.size()-init))
      |                                                                                                       ~~~~^~~~~~~~~~~~~~~~
Ioi.cpp: In function 'long long int solve(int, int)':
Ioi.cpp:148:107: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  148 |     if((cntdr==60 && cntst<60) || (cntdr==60 && cntst==60 && pozdr<pozst) || (cntdr<60 && cntst<60 && init>ord.size()-init))
      |                                                                                                       ~~~~^~~~~~~~~~~~~~~~
Ioi.cpp: In function 'long long int Ioi(int, int, int*, int*, int, int, int)':
Ioi.cpp:148:59: warning: 'pozst' may be used uninitialized in this function [-Wmaybe-uninitialized]
  148 |     if((cntdr==60 && cntst<60) || (cntdr==60 && cntst==60 && pozdr<pozst) || (cntdr<60 && cntst<60 && init>ord.size()-init))
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
Ioi.cpp:119:25: note: 'pozst' was declared here
  119 |     int cntst=0,cntdr=0,pozst,pozdr;
      |                         ^~~~~
Ioi.cpp:148:59: warning: 'pozdr' may be used uninitialized in this function [-Wmaybe-uninitialized]
  148 |     if((cntdr==60 && cntst<60) || (cntdr==60 && cntst==60 && pozdr<pozst) || (cntdr<60 && cntst<60 && init>ord.size()-init))
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
Ioi.cpp:119:31: note: 'pozdr' was declared here
  119 |     int cntst=0,cntdr=0,pozst,pozdr;
      |                               ^~~~~
Ioi.cpp:273:9: warning: 'pozst' may be used uninitialized in this function [-Wmaybe-uninitialized]
  273 |         if(aux<mnm)
      |         ^~
Ioi.cpp:273:9: warning: 'mnm' may be used uninitialized in this function [-Wmaybe-uninitialized]
Ioi.cpp:71:31: warning: 'pozdr' may be used uninitialized in this function [-Wmaybe-uninitialized]
   71 |     int cntst=0,cntdr=0,pozst,pozdr;
      |                               ^~~~~

• Subtask 1: 8 / 8
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 55 / 55
• Subtask 5: 0 / 17