oj.uz

답안 #162017

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
162017 2019-11-05T19:51:25 Z nafis_shifat 곤돌라 (IOI14_gondola) C++14
50 / 100
 24 ms 2404 KB 
#include "gondola.h"
#include<bits/stdc++.h>
#define pii pair<int,int>
#define ll long long
using namespace std;
const ll mod=1e9+7;



ll bigmod(ll a,ll b)
{
	if(b==0)return 1;
	ll mid=b/2;
	ll c=bigmod(a,mid);
	if(b%2==0)return (c*c)%mod;
	 c=(c*c)%mod;
	return (a*c)%mod;
}

int valid(int n, int inputSeq[])
{
	int st=-1;
	for(int i=0;i<n;i++)if(inputSeq[i]<=n)
	{
		st=i;break;
	}
	if(st==-1)return 1;
    int kb=inputSeq[st]+1;
    
    for(int i=st+1;i<n;i++)
    {
    	if(kb>n)kb=1;
    	if(inputSeq[i]!=kb++ && inputSeq[i]<=n)return 0;
    }
    for(int i=0;i<st;i++)
    {
    	if(kb>n)kb=1;
    	if(inputSeq[i]!=kb++ && inputSeq[i]<=n)return 0;
    }
    return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	int st=-1;
	vector<pii> v;
	for(int i=0;i<n;i++)
	{
		if(gondolaSeq[i]<=n)
		{
			st=i;
			break;
		}
		
	}

	if(st==-1)
	{
		for(int i=0;i<n;i++)if(gondolaSeq[i]>n)v.push_back({gondolaSeq[i],i+1});
	}
    else
    {
    	int s;
    	if(gondolaSeq[st]>st)s=gondolaSeq[st]-st;
    	else s=n-(st-gondolaSeq[st]);
    	for(int i=0;i<n;i++)
    	{
    		if(s==n+1)s=1;
    		if(gondolaSeq[i]>n)
    		{
    		    v.push_back({gondolaSeq[i],s});
    		    
    		}
    		s++;
    	}
    }

    sort(v.begin(),v.end());

    int li=0;
    int tr=n+1;


    for(int i=0;i<v.size();i++)
    {
    	replacementSeq[li++]=v[i].second;

    	while(tr<v[i].first)
    	{
    	
    		replacementSeq[li++]=tr++;
    	}
    	tr++;

    }
    return li;


    

}

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

int countReplacement(int n, int inputSeq[])
{


	if(!valid(n,inputSeq))return 0;

	int df=0;

	vector<ll> v;
	for(int i=0;i<n;i++)
		if(inputSeq[i]<=n)df=1;
	    else v.push_back(inputSeq[i]);
	sort(v.begin(),v.end());
	ll last=n;
	ll sz=v.size();
	ll res=1;

	for(int i=0;i<sz;i++)
	{
		ll dd=v[i]-df-last;
		
	

		res*=bigmod(sz-i,dd);
	
	
		res%=mod;
		last=v[i];


	}
	return res;

}

Compilation message

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 368 KB Output is correct
6 Correct 7 ms 632 KB Output is correct
7 Correct 13 ms 1144 KB Output is correct
8 Correct 12 ms 1016 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 12 ms 1148 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 7 ms 760 KB Output is correct
7 Correct 14 ms 1272 KB Output is correct
8 Correct 11 ms 1016 KB Output is correct
9 Correct 5 ms 508 KB Output is correct
10 Correct 13 ms 1144 KB Output is correct
11 Incorrect 2 ms 256 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 12 ms 1144 KB Output is correct
12 Correct 13 ms 1144 KB Output is correct
13 Correct 17 ms 1532 KB Output is correct
14 Correct 12 ms 1144 KB Output is correct
15 Correct 24 ms 2404 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 252 KB Output is correct

Subtask #8
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 368 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 296 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Incorrect 2 ms 256 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Incorrect 2 ms 256 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 252 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Incorrect 2 ms 252 KB Output isn't correct
8 Halted 0 ms 0 KB -