oj.uz

답안 #1071691

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1071691 2024-08-23T10:03:09 Z cpdreamer 곤돌라 (IOI14_gondola) C++14
75 / 100
 1000 ms 2360 KB 
#include "gondola.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <utility>
using namespace std;
typedef long long ll;
#define V vector
#define F first
#define S second
#define P pair
#define pb push_back
#define all(v) v.begin(),v.end()
int valid(int n, int inputSeq[])
{
    int id=-1;
    for(int i=0;i<n;i++){
        if(inputSeq[i]==1) {
            id = i;
            break;
        }
    }
    if(id==-1)
        return 0;
    int c=2;
    for(int i=(id+1)%n;i!=id;i=(i+1)%n){
        if(inputSeq[i]!=c)
            return 0;
        c++;
    }
    return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
    int id = -1, val;
    for (int i = 0; i < n; i++) {
        if (gondolaSeq[i] <= n) {
            id = i;
            val = gondolaSeq[i];
            break;
        }
    }
    P<int, int> original[n];
    if (id != -1) {
        original[id].S = val;
        original[id].F = gondolaSeq[id];
        val=(val+1)%(n+1);
        if(val==0)
            val=1;
        for (int i = (id + 1) % n; i != id; i = (i + 1) % n) {
            original[i].S = val;
            original[i].F = gondolaSeq[i];
            val=(val+1)%(n+1);
            if(val==0)
                val=1;
        }
    } else {
        for (int i = 0; i < n; i++) {
            original[i].S = i + 1;
            original[i].F = gondolaSeq[i];
        }
    }
    int limit = n + 1;
    V<int> replace;
    sort(original, original + n);
    for (int i = 0; i < n; i++) {
        if (original[i].F != original[i].S) {
            replace.pb(original[i].S);
            for (int j = limit; j < original[i].F; j++) {
                replace.pb(j);
            }
            limit = original[i].F+1;
        }
    }
    for(int i=0;i<replace.size();i++){
        replacementSeq[i]=replace[i];
    }
    return (int)replace.size();
}
//----------------------

int countReplacement(int n, int inputSeq[]) {
    ll ans=1;
    ll mod=1e9+9;
    sort(inputSeq,inputSeq+n);
    for(int i=n+1;i<= *max_element(inputSeq,inputSeq+n)-1;i++){
        int l=0,r=n-1;
        int v=-1;
        while(l<=r){
            int m=l+(r-l)/2;
            if(inputSeq[m]>=i){
                v=m;
                r=m-1;
            }
            else{
                l=m+1;
            }
        }
        if(v!=-1) {
            if (inputSeq[v] != i) {
                ans = (ans * (n - v)) % mod;
            }
        }
    }
    if(*min_element(inputSeq,inputSeq+n)>n){
        ans=(ans*n)%mod;
    }
    ans=ans%mod;
    return (int)ans;
 }

Compilation message

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:76:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |     for(int i=0;i<replace.size();i++){
      |                 ~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 3 ms 544 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 5 ms 604 KB Output is correct
9 Correct 3 ms 500 KB Output is correct
10 Correct 6 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 3 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 7 ms 604 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 11 ms 1368 KB Output is correct
12 Correct 8 ms 1372 KB Output is correct
13 Correct 9 ms 1496 KB Output is correct
14 Correct 8 ms 1140 KB Output is correct
15 Correct 13 ms 2360 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Execution timed out 1098 ms 1076 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Execution timed out 1098 ms 1104 KB Time limit exceeded
10 Halted 0 ms 0 KB -