oj.uz

Submission #107796

# Submission time Handle Problem Language Result Execution time Memory
107796 2019-04-25T19:53:33 Z FiloSanza Gondola (IOI14_gondola) C++14
75 / 100
 53 ms 4608 KB 
#include <bits/stdc++.h>
#include "gondola.h"

using namespace std;

int valid(int N, int inputSeq[])
{
    int ind = -1, x = -1;
	for(int i = 0; i < N; i++) {
		if(inputSeq[i] <= N) {
			ind = i;
			x = inputSeq[i];
			break;
		}
	}
	for(int i = ind + 1; i < N; i++) {
		if(inputSeq[i] <= N && (x + i - ind - 1) % N + 1 != inputSeq[i])
			return 0;
	}

    set<int> s;
    for(int i=0; i<N; i++) s.insert(inputSeq[i]);
    if(s.size() != N) return 0;
    return 1;
}

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

int replacement(int N, int gondolaSeq[], int replacementSeq[])
{
    int cont = 0;
    vector<int> seq;
    vector<pair<int, int>> s;
    vector<int> v;

    for(int i=0; i<N; i++) 
        if(gondolaSeq[i] <= N)
            v.push_back(gondolaSeq[i]);

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

    if(!v.empty()){
        deque<int> q;
        for(int i=0; i<N; i++) q.push_back(gondolaSeq[i]);

        while(q.front() != v.front()){
            q.push_front(q.back());
            q.pop_back();
        }

        for(int i=1; i<v.front(); i++){
            q.push_front(q.back());
            q.pop_back();
        }
        
        while(!q.empty()){
            seq.push_back(q.front());
            q.pop_front();
        }
    }
    else{
        for(int i=0; i<N; i++) seq.push_back(gondolaSeq[i]);
    }
    
    for(int i=0; i<N; i++){
        if(seq[i] >= N)
            s.push_back({seq[i], i+1});
    }

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

    if(s.empty()) return 0;

    int nxt = N+1;
    for(auto i : s){
        int to = i.second;
        while(nxt <= i.first){
            replacementSeq[cont++] = to;
            to = nxt;
            nxt++;
        }
    }

    return cont;
}

//----------------------
const int MOD = 1e9+9;

int power(int b, int e){
    int res = 1;
    for(int i=0; i<e; i++) res = (1LL * res*b)%MOD;
    return res % MOD;
}

int countReplacement(int N, int gondolaSeq[])
{
    if(valid(N, gondolaSeq) == 0) return 0;

    int maxi = *max_element(gondolaSeq, gondolaSeq+N);
    vector<int> v;
    v.reserve(N);
    for(int i=0; i<N; i++) if(gondolaSeq[i] > N) v.push_back(gondolaSeq[i]);
    sort(v.begin(), v.end());
    int curr = N;

    int ans = 1;
    for(int i=0; i<v.size(); i++){
        ans = (1LL * ans * (int)power(v.size() - i, v[i] - curr - 1)) % MOD;
        curr = v[i];
    }

    if(*min_element(gondolaSeq, gondolaSeq+N) > N) ans = (ans * N) % MOD;

    return ans;
}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:23:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(s.size() != N) return 0;
        ~~~~~~~~~^~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:108:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<v.size(); i++){
                  ~^~~~~~~~~
gondola.cpp:100:9: warning: unused variable 'maxi' [-Wunused-variable]
     int maxi = *max_element(gondolaSeq, gondolaSeq+N);
         ^~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 16 ms 2176 KB Output is correct
7 Correct 14 ms 640 KB Output is correct
8 Correct 26 ms 3968 KB Output is correct
9 Correct 10 ms 1536 KB Output is correct
10 Correct 33 ms 4608 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 14 ms 2176 KB Output is correct
7 Correct 14 ms 640 KB Output is correct
8 Correct 31 ms 3904 KB Output is correct
9 Correct 10 ms 1536 KB Output is correct
10 Correct 33 ms 4608 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 7 ms 512 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 13 ms 640 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory 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 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 14 ms 2140 KB Output is correct
12 Correct 16 ms 2168 KB Output is correct
13 Correct 15 ms 1400 KB Output is correct
14 Correct 17 ms 2040 KB Output is correct
15 Correct 21 ms 2416 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 3 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 51 ms 4088 KB Output is correct
10 Correct 46 ms 3448 KB Output is correct
11 Correct 15 ms 1536 KB Output is correct
12 Correct 18 ms 1664 KB Output is correct
13 Incorrect 5 ms 640 KB Integer -643084670 violates the range [0, 1000000008]

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 53 ms 4088 KB Output is correct
10 Correct 34 ms 3456 KB Output is correct
11 Correct 15 ms 1408 KB Output is correct
12 Correct 17 ms 1792 KB Output is correct
13 Incorrect 7 ms 640 KB Integer -643084670 violates the range [0, 1000000008]
14 Halted 0 ms 0 KB -