oj.uz

Submission #306888

# Submission time Handle Problem Language Result Execution time Memory
306888 2020-09-26T13:42:08 Z vipghn2003 Gondola (IOI14_gondola) C++14
100 / 100
 39 ms 4212 KB 
#include "gondola.h"
#include<bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
using namespace std;

const int mod=1e9+9;
const int N=1e5+5;
int ST[4*N],lazy[4*N];

int Power(int x,int n)
{
    if(!n) return 1;
    if(n%2) return 1ll*Power(x,n-1)*x%mod;
    int tmp=Power(x,n/2);
    return 1ll*tmp*tmp%mod;
}

int expect[N*2],initSeq[N];
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	int offs = 0;
	int dummy = 0;
	int mx = -1;
	memset(expect, -1, sizeof(expect));
	for(int i = 0; i < n; i++){
		if(gondolaSeq[i] <= n) offs = (n+i-gondolaSeq[i]+1) % n;
		else expect[gondolaSeq[i]] = i;
		if(gondolaSeq[i] > mx){
			mx = gondolaSeq[i];
			dummy = i;
		}
	}
	for(int i = 0; i < n; i++){
		initSeq[(i+offs) % n] = i+1;
	}
	int rpidx = 0;
	for(int i = n+1; i <= mx; i++){
		if(expect[i] == -1){
			replacementSeq[rpidx++] = initSeq[dummy];
			initSeq[dummy] = i;
		}else{
			replacementSeq[rpidx++] = initSeq[expect[i]];
			initSeq[expect[i]] = i;
		}
	}
	return rpidx;
}

int countReplacement(int n,int inputSeq[])
{
    memset(ST,0,sizeof ST);
    vector<int>b(n),cur;
    for(int i=0;i<n;i++)
    {
        inputSeq[i]--;
        b[i]=inputSeq[i];
    }
    int res=0;
    int val=0;
    sort(b.begin(),b.end());
    for(int j=1;j<n;j++) if(b[j]==b[j-1]) return 0;
    for(int j=0;j<n;j++)
    {
        if(inputSeq[j]>(n-1)) cur.push_back(inputSeq[j]-n+1);
    }
    if(cur.empty()) val=1;
    else
    {
        sort(cur.begin(),cur.end());
        int sz=cur.size();
        val=Power(sz,cur[0]-1);
        for(int j=1;j<sz;j++)
        {
            if(cur[j]==cur[j-1])
            {
                val=0;
                break;
            }
            val=1ll*val*Power(sz-j,cur[j]-cur[j-1]-1)%mod;
        }
    }
    if(cur.size()==n) res=1ll*val*n%mod;
    else
    {
        int id;
        for(int j=0;j<n;j++)
        {
            if(inputSeq[j]<=(n-1)) id=j;
        }
        int cnt=inputSeq[id];
        for(int j=id,k=1;k<=n;j=(j+1)%n,k++)
        {
            if(inputSeq[j]<n&&inputSeq[j]!=cnt) return 0;
            cnt=(cnt+1)%n;
        }
        res=val;
    }
    return res;
}

int valid(int n,int inputSeq[])
{
    return countReplacement(n,inputSeq)!=0;
}
/*
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin>>n;
    int a[n];
    for(int i=0;i<n;i++) cin>>a[i];
    cout<<countReplacement(n,a);
}
*/

Compilation message

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:85:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   85 |     if(cur.size()==n) res=1ll*val*n%mod;
      |        ~~~~~~~~~~^~~
gondola.cpp:93:26: warning: 'id' may be used uninitialized in this function [-Wmaybe-uninitialized]
   93 |         int cnt=inputSeq[id];
      |                          ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1920 KB Output is correct
2 Correct 1 ms 1920 KB Output is correct
3 Correct 1 ms 1920 KB Output is correct
4 Correct 2 ms 1920 KB Output is correct
5 Correct 1 ms 1920 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1920 KB Output is correct
2 Correct 2 ms 1920 KB Output is correct
3 Correct 1 ms 1920 KB Output is correct
4 Correct 2 ms 1920 KB Output is correct
5 Correct 1 ms 1920 KB Output is correct
6 Correct 10 ms 2176 KB Output is correct
7 Correct 20 ms 2560 KB Output is correct
8 Correct 15 ms 2432 KB Output is correct
9 Correct 7 ms 2048 KB Output is correct
10 Correct 20 ms 2560 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1920 KB Output is correct
2 Correct 1 ms 1920 KB Output is correct
3 Correct 1 ms 1920 KB Output is correct
4 Correct 1 ms 1920 KB Output is correct
5 Correct 1 ms 1920 KB Output is correct
6 Correct 10 ms 2176 KB Output is correct
7 Correct 20 ms 2560 KB Output is correct
8 Correct 15 ms 2432 KB Output is correct
9 Correct 7 ms 2048 KB Output is correct
10 Correct 21 ms 2560 KB Output is correct
11 Correct 2 ms 1920 KB Output is correct
12 Correct 1 ms 1920 KB Output is correct
13 Correct 13 ms 2560 KB Output is correct
14 Correct 1 ms 1952 KB Output is correct
15 Correct 23 ms 2816 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1152 KB Output is correct
5 Correct 1 ms 1152 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1152 KB Output is correct
5 Correct 1 ms 1152 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 2 ms 1152 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1152 KB Output is correct
5 Correct 1 ms 1152 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 2 ms 1152 KB Output is correct
11 Correct 13 ms 1664 KB Output is correct
12 Correct 14 ms 1792 KB Output is correct
13 Correct 15 ms 2048 KB Output is correct
14 Correct 12 ms 1664 KB Output is correct
15 Correct 23 ms 2944 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1920 KB Output is correct
2 Correct 1 ms 1920 KB Output is correct
3 Correct 1 ms 1920 KB Output is correct

Subtask #8
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1920 KB Output is correct
2 Correct 1 ms 1920 KB Output is correct
3 Correct 2 ms 1920 KB Output is correct
4 Correct 2 ms 1920 KB Output is correct
5 Correct 1 ms 1920 KB Output is correct
6 Correct 1 ms 1920 KB Output is correct
7 Correct 2 ms 1920 KB Output is correct
8 Correct 1 ms 1920 KB Output is correct

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1920 KB Output is correct
2 Correct 1 ms 1920 KB Output is correct
3 Correct 1 ms 1920 KB Output is correct
4 Correct 2 ms 1920 KB Output is correct
5 Correct 1 ms 1920 KB Output is correct
6 Correct 2 ms 1920 KB Output is correct
7 Correct 1 ms 1920 KB Output is correct
8 Correct 2 ms 1920 KB Output is correct
9 Correct 25 ms 3328 KB Output is correct
10 Correct 21 ms 3200 KB Output is correct
11 Correct 9 ms 2432 KB Output is correct
12 Correct 11 ms 2560 KB Output is correct
13 Correct 4 ms 2048 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1920 KB Output is correct
2 Correct 1 ms 1920 KB Output is correct
3 Correct 1 ms 1920 KB Output is correct
4 Correct 2 ms 1920 KB Output is correct
5 Correct 2 ms 1920 KB Output is correct
6 Correct 1 ms 1920 KB Output is correct
7 Correct 1 ms 1920 KB Output is correct
8 Correct 2 ms 1920 KB Output is correct
9 Correct 26 ms 3328 KB Output is correct
10 Correct 21 ms 3200 KB Output is correct
11 Correct 10 ms 2432 KB Output is correct
12 Correct 13 ms 2560 KB Output is correct
13 Correct 3 ms 2048 KB Output is correct
14 Correct 39 ms 4116 KB Output is correct
15 Correct 37 ms 4212 KB Output is correct
16 Correct 8 ms 2432 KB Output is correct
17 Correct 24 ms 3380 KB Output is correct
18 Correct 15 ms 2944 KB Output is correct