oj.uz

답안 #68809

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
68809 2018-08-18T14:25:31 Z Vahan 곤돌라 (IOI14_gondola) C++17
20 / 100
 27 ms 2852 KB 
#include "gondola.h"
#include<vector>
#include<algorithm>
using namespace std;
int x[200000],xx[200000];
int mod=1000000007;
vector<int> g;
int valid(int n, int inputSeq[])
{
    vector<int> v;
    for(int i=0;i<n;i++)
        xx[i]=inputSeq[i];
    sort(xx,xx+n);
    int t=0;
    for(int i=1;i<n;i++)
        if(xx[i]==xx[i-1])
        {
            t=1;
            break;
        }
    if(t==1)
        return 0;
    for(int i=0;i<n;i++)
    {
        if(inputSeq[i]<=n)
        {
            v.push_back(inputSeq[i]);
            x[inputSeq[i]]=i;
        }
    }
    t=0;
    for(int 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(int 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;
}
int binpow(int a,int b)
{
    if(b==0)
        return 1;
    if(b%2==0)
    {
        int c=binpow(a,b/2);
        return (c*c)%mod;
    }
    else
    {
        int c=binpow(a,b/2);
        return (b*(c*c)%mod)%mod;
    }
}
//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  return -2;
}

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

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

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:32:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=1;i<v.size();i++)
                 ~^~~~~~~~~
gondola.cpp:42:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=1;i<v.size();i++)
                 ~^~~~~~~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:103:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<g.size();i++)
                 ~^~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 408 KB Output is correct
4 Correct 2 ms 548 KB Output is correct
5 Correct 2 ms 548 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 576 KB Output is correct
2 Correct 2 ms 576 KB Output is correct
3 Correct 2 ms 576 KB Output is correct
4 Correct 3 ms 600 KB Output is correct
5 Correct 3 ms 600 KB Output is correct
6 Correct 11 ms 1380 KB Output is correct
7 Correct 21 ms 1380 KB Output is correct
8 Correct 19 ms 2020 KB Output is correct
9 Correct 7 ms 2020 KB Output is correct
10 Correct 20 ms 2168 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2168 KB Output is correct
2 Correct 2 ms 2168 KB Output is correct
3 Correct 3 ms 2168 KB Output is correct
4 Correct 2 ms 2168 KB Output is correct
5 Correct 3 ms 2168 KB Output is correct
6 Correct 11 ms 2168 KB Output is correct
7 Correct 22 ms 2168 KB Output is correct
8 Correct 21 ms 2168 KB Output is correct
9 Correct 8 ms 2168 KB Output is correct
10 Correct 22 ms 2168 KB Output is correct
11 Correct 3 ms 2168 KB Output is correct
12 Correct 2 ms 2168 KB Output is correct
13 Correct 11 ms 2168 KB Output is correct
14 Correct 3 ms 2168 KB Output is correct
15 Correct 27 ms 2852 KB Output is correct

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2852 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2852 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2852 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2852 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2852 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 2852 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2852 KB Output isn't correct
2 Halted 0 ms 0 KB -