답안 #878452

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
878452	2023-11-24T11:33:46 Z	JakobZorz	곤돌라 (IOI14_gondola)	C++14	25 / 100	11 ms	4700 KB

gondola

#include"gondola.h"
#include<iostream>
#include<unordered_set>
using namespace std;

int valid(int n,int inputSeq[]){
    unordered_set<int>s(inputSeq,inputSeq+n);
    if(s.size()!=n)
        return 0;
    int curr=-1;
    for(int i=0;i<2*n;i++){
        if(curr==-1&&inputSeq[i%n]<=n)
            curr=inputSeq[i%n];
        
        if(inputSeq[i%n]<=n&&curr!=inputSeq[i%n])
            return 0;
        
        curr++;
        if(curr==n+1)
            curr=1;
    }
    return 1;
}

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

int replacement(int n,int gondolaSeq[],int replacementSeq[]){
    int len=0;
    int mx=0;
    for(int i=0;i<n;i++)
        mx=max(mx,gondolaSeq[i]);
    len=mx-n;
    for(int i=0;i<len;i++)
        replacementSeq[i]=0;
    
    if(len==0)
        return 0;
    
    int curr=-1;
    for(int i=0;i<2*n;i++){
        if(curr==-1&&gondolaSeq[i%n]<=n)
            curr=gondolaSeq[i%n];
        
        if(i>=n&&gondolaSeq[i%n]<mx&&gondolaSeq[i%n]>n){
            replacementSeq[gondolaSeq[i%n]]=curr;
        }
        
        curr++;
        if(curr==n+1)
            curr=1;
    }
    
    curr=-1;
    for(int i=0;i<2*n;i++){
        if(curr==-1&&gondolaSeq[i%n]<=n)
            curr=gondolaSeq[i%n];
        
        if(i>=n&&gondolaSeq[i%n]==mx){
            int prev=curr;
            for(int i=0;i<len;i++){
                if(replacementSeq[i]==0){
                    replacementSeq[i]=curr;
                    curr=i+n+1;
                }
            }
        }
        
        curr++;
        if(curr==n+1)
            curr=1;
    }
    
    return len;
}

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

int countReplacement(int n,int inputSeq[]){
    return -3;
}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:8:16: warning: comparison of integer expressions of different signedness: 'std::unordered_set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    8 |     if(s.size()!=n)
      |        ~~~~~~~~^~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:59:17: warning: unused variable 'prev' [-Wunused-variable]
   59 |             int prev=curr;
      |                 ^~~~

Subtask #1
5.0 / 5.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	440 KB	Output is correct

Subtask #2
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
6	Correct	5 ms	2140 KB	Output is correct
7	Correct	10 ms	3932 KB	Output is correct
8	Correct	10 ms	3932 KB	Output is correct
9	Correct	3 ms	1336 KB	Output is correct
10	Correct	11 ms	4444 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 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	5 ms	2140 KB	Output is correct
7	Correct	10 ms	3932 KB	Output is correct
8	Correct	10 ms	3904 KB	Output is correct
9	Correct	3 ms	1368 KB	Output is correct
10	Correct	11 ms	4444 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	5 ms	2140 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	11 ms	4700 KB	Output is correct

Subtask #4
5.0 / 5.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	440 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct

Subtask #5
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	604 KB	Output is correct
4	Correct	1 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	Incorrect	0 ms	348 KB	Output isn't correct
8	Halted	0 ms	0 KB	-

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	444 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	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Incorrect	0 ms	348 KB	Output isn't correct
8	Halted	0 ms	0 KB	-

Subtask #7
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	344 KB	Integer -3 violates the range [0, 1000000008]
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	348 KB	Integer -3 violates the range [0, 1000000008]
2	Halted	0 ms	0 KB	-

Subtask #9
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	344 KB	Integer -3 violates the range [0, 1000000008]
2	Halted	0 ms	0 KB	-

Subtask #10
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	348 KB	Integer -3 violates the range [0, 1000000008]
2	Halted	0 ms	0 KB	-