제출 #428377

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
428377		Amylopectin	Gondola (IOI14_gondola)	C++14	80 / 100	1084 ms	2636 KiB

gondola

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include "gondola.h"
//#include "grader.cpp"
using namespace std;
const long long mxn = 4e5 + 10,mo = 1e9 + 9;
struct we
{
    long long stn,thn;
};
bool cmp(const struct we &l,const struct we &r)
{
    return l.thn < r.thn;
}
struct we so[mxn] = {};
int valid(int n, int inp[])
{
    long long i,j,m,stp = -1,of = 0;
    for(i=0; i<n; i++)
    {
        if(stp == -1 && inp[i] <= n)
        {
            stp = i - inp[i] + 1;
            if(stp < 0)
            {
                stp += n;
            }
        }
        if(stp >= 0 && inp[i] <= n)
        {
            if((stp + inp[i] - 1) % n != i)
            {
                of = 1;
                break;
            }
        }
    }
    if(of == 0)
    {
        return 1;
    }
    return 0;
}
int replacement(int n, int inp[], int ans[])
{
    long long i,j,ru = 0,stp = -1,fr,ba,rua = 0;
    for(i=0; i<n; i++)
    {
        if(stp == -1 && inp[i] <= n)
        {
            stp = i - inp[i] + 1;
            if(stp < 0)
            {
                stp += n;
            }
            break;
        }
    }
    if(stp == -1)
    {
        stp = 0;
    }
    for(i=0; i<n; i++)
    {
        if(inp[i] > n)
        {
            so[ru] = {(i + n - stp) % n + 1,inp[i]};
            ru ++;
        }
    }
    sort(so,so+ru,cmp);
    fr = 0;
    ba = 0;
//    while(ba <  ru)
//    {
//    }
    for(i=n+1; i<=so[ru-1].thn; i++)
    {
        if(i == so[fr].thn)
        {
            ans[rua] = so[fr].stn;
            rua ++;
            fr ++;
//            if(ba < fr)
//            {
//                ba = fr;
//            }
        }
        else
        {
            ans[rua] = so[fr].stn;
            so[fr].stn = i;
            rua ++;
        }
    }
    return rua;
}
int countReplacement(int n, int inp[])
{
    long long i,j,m,stp = -1,of = 0,ans = 1,be,ru = 0,off = 0;
    for(i=0; i<n; i++)
    {
        if(stp == -1 && inp[i] <= n)
        {
            stp = i - inp[i] + 1;
            if(stp < 0)
            {
                stp += n;
            }
        }
        if(stp >= 0 && inp[i] <= n)
        {
            if((stp + inp[i] - 1) % n != i)
            {
                of = 1;
                break;
            }
        }
    }
    if(of == 1)
    {
        return 0;
    }
    if(stp == -1)
    {
        off = 1;
        ans *= n;
        stp = 0;
    }
    for(i=0; i<n; i++)
    {
        if(inp[i] > n)
        {
            so[ru] = {(i + n - stp) % n + 1,inp[i]};
            ru ++;
        }
    }
    sort(so,so+ru,cmp);
    be = n;
    for(i=0; i<ru; i++)
    {
        for(j=be+1; j<so[i].thn; j++)
        {
            ans *= ru-i;
            ans %= mo;
        }
        be = so[i].thn;
    }
    return ans;
//    return -3;
}
//int main()
//{
//
//    return 0;
//}

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:19:17: warning: unused variable 'j' [-Wunused-variable]
   19 |     long long i,j,m,stp = -1,of = 0;
      |                 ^
gondola.cpp:19:19: warning: unused variable 'm' [-Wunused-variable]
   19 |     long long i,j,m,stp = -1,of = 0;
      |                   ^
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:47:17: warning: unused variable 'j' [-Wunused-variable]
   47 |     long long i,j,ru = 0,stp = -1,fr,ba,rua = 0;
      |                 ^
gondola.cpp:47:38: warning: variable 'ba' set but not used [-Wunused-but-set-variable]
   47 |     long long i,j,ru = 0,stp = -1,fr,ba,rua = 0;
      |                                      ^~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:101:19: warning: unused variable 'm' [-Wunused-variable]
  101 |     long long i,j,m,stp = -1,of = 0,ans = 1,be,ru = 0,off = 0;
      |                   ^
gondola.cpp:101:55: warning: variable 'off' set but not used [-Wunused-but-set-variable]
  101 |     long long i,j,m,stp = -1,of = 0,ans = 1,be,ru = 0,off = 0;
      |                                                       ^~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 20 / 20
• Subtask 7: 5 / 5
• Subtask 8: 15 / 15
• Subtask 9: 15 / 15
• Subtask 10: 0 / 10