oj.uz

답안 #107795

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
107795 2019-04-25T19:52:19 Z FiloSanza 곤돌라 (IOI14_gondola) C++14
90 / 100
 1000 ms 5368 KB 
#include <bits/stdc++.h>
#include "gondola.h"

using namespace std;

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

    set<long long> s;
    for(long long 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[])
{
    long long cont = 0;
    vector<long long> seq;
    vector<pair<long long, long long>> s;
    vector<long long> v;

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

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

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

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

        for(long long 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(long long i=0; i<N; i++) seq.push_back(gondolaSeq[i]);
    }
    
    for(long long 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;

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

    return cont;
}

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

long long power(long long b, long long e){
    long long res = 1;
    for(long long 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;

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

    long long ans = 1;
    for(long long i=0; i<v.size(); i++){
        ans = (1LL * ans * (long long)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:107:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(long long i=0; i<v.size(); i++){
                        ~^~~~~~~~~
gondola.cpp:100:15: warning: unused variable 'maxi' [-Wunused-variable]
     long long maxi = *max_element(gondolaSeq, gondolaSeq+N);
               ^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 356 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 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 368 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 412 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 14 ms 2304 KB Output is correct
7 Correct 12 ms 692 KB Output is correct
8 Correct 27 ms 4096 KB Output is correct
9 Correct 9 ms 1536 KB Output is correct
10 Correct 34 ms 4472 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 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
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 13 ms 2304 KB Output is correct
7 Correct 11 ms 640 KB Output is correct
8 Correct 23 ms 3968 KB Output is correct
9 Correct 8 ms 1536 KB Output is correct
10 Correct 33 ms 4600 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 12 ms 768 KB Output is correct

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 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct

Subtask #5
10.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 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 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

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 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 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 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 3 ms 384 KB Output is correct
11 Correct 19 ms 3444 KB Output is correct
12 Correct 18 ms 3700 KB Output is correct
13 Correct 16 ms 1720 KB Output is correct
14 Correct 15 ms 3444 KB Output is correct
15 Correct 20 ms 2264 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 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

Subtask #8
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 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
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct

Subtask #9
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 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 256 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 384 KB Output is correct
9 Correct 53 ms 4072 KB Output is correct
10 Correct 39 ms 3448 KB Output is correct
11 Correct 15 ms 1408 KB Output is correct
12 Correct 17 ms 1664 KB Output is correct
13 Correct 8 ms 640 KB Output is correct

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 256 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 384 KB Output is correct
8 Correct 3 ms 256 KB Output is correct
9 Correct 51 ms 4024 KB Output is correct
10 Correct 32 ms 3448 KB Output is correct
11 Correct 18 ms 1528 KB Output is correct
12 Correct 20 ms 1664 KB Output is correct
13 Correct 6 ms 640 KB Output is correct
14 Execution timed out 1074 ms 5368 KB Time limit exceeded
15 Halted 0 ms 0 KB -