제출 #68813

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
68813		Vahan	곤돌라 (IOI14_gondola)	C++17	40 / 100	32 ms	3188 KiB

gondola

#include "gondola.h"
#include<vector>
#include<algorithm>
#include<iostream>
using namespace std;
long long x[200000],xx[200000];
long long mod=1000000009;
vector<long long> g;
int valid(int n, int inputSeq[])
{
    vector<long long> v;
    for(long long i=0;i<n;i++)
        xx[i]=inputSeq[i];
    sort(xx,xx+n);
    long long t=0;
    for(long long i=1;i<n;i++)
        if(xx[i]==xx[i-1])
        {
            t=1;
            break;
        }
    if(t==1)
        return 0;
    for(long long i=0;i<n;i++)
    {
        if(inputSeq[i]<=n)
        {
            v.push_back(inputSeq[i]);
            x[inputSeq[i]]=i;
        }
    }
    t=0;
    for(long long i=1;i<v.size();i++)
    {
        if(v[i-1]>v[i])
            t++;
    }
    if(t>=2)
        return 0;
    if(t==1 && v.back()>v[0])
        return 0;
    t=0;
    for(long long i=1;i<v.size();i++)
    {
        if(v[i-1]<v[i])
        {
            if(v[i]-v[i-1]!=x[v[i]]-x[v[i-1]])
            {
                t=1;
                break;
            }
        }
        else if(v[i-1]>v[i])
        {
            if((n-(v[i-1]-v[i]))!=x[v[i]]-x[v[i-1]])
            {
                t=1;
                break;
            }
        }
    }
    if(t==1)
        return 0;
    return 1;
}
long long binpow(long long a,long long b)
{
    if(b==0)
        return 1;
    if(b%2==0)
    {
        long long c=binpow(a,b/2);
        return (c*c)%mod;
    }
    else
    {
        long long c=binpow(a,b/2);
        return (a*(c*c)%mod)%mod;
    }
}
//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    /*vector<pair<int,int> >v;
    for(int i=0;i<n;i++)
    {
        if(gondolaSeq[i]<n)
        {
            a[i]=gondolaSeq[i];
        }
    }*/
  return -2;
}

//----------------------

int countReplacement(int n, int inputSeq[])
{
    if(valid(n,inputSeq)==0)
        return 0;
    for(long long i=0;i<n;i++)
    {
        if(inputSeq[i]>n)
            g.push_back(inputSeq[i]);
    }
    sort(g.begin(),g.end());
    long long k=g.size();
    long long pat=1;
    for(long long i=0;i<g.size();i++)
    {
        long long u;
        if(i==0)
            u=g[i]-n-1;
        else
            u=g[i]-g[i-1]-1;
        pat*=binpow(k,u);
        pat%=mod;
        k--;
    }
    if(g.size()==n)
        pat*=n;
    pat%=mod;
    return pat;
}

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:33:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(long long i=1;i<v.size();i++)
                       ~^~~~~~~~~
gondola.cpp:43:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(long long i=1;i<v.size();i++)
                       ~^~~~~~~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:110:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(long long i=0;i<g.size();i++)
                       ~^~~~~~~~~
gondola.cpp:121:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(g.size()==n)
        ~~~~~~~~^~~

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