oj.uz

Submission #842644

# Submission time Handle Problem Language Result Execution time Memory
842644 2023-09-03T07:04:43 Z Warinchai Gondola (IOI14_gondola) C++14
20 / 100
 33 ms 5296 KB 
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
int valid(int n, int s[])
{
    map<int,int>mp;
    int prev=0,count=0;
    int first=0;
    int mn=INT_MAX;
    int idm=0;
    for(int i=0;i<n;i++){
        mp[s[i]]++;
        if(mp[s[i]]>1){
            return 0;
        }
        if(s[i]<=n){
            if(first==0){
                first=s[i];
            }
            if(s[i]<mn){
                mn=s[i];
                idm=i;
            }
            if(s[i]<prev){
                count++;
            }
            prev=s[i];
        }
    }
    if(first<prev){
        count++;
    }
    if(count>1){
        return 0;
    }
    for(int i=idm;i<idm+n&&first+i-idm<=n;i++){
        int id=i%n;
        if(s[id]<=n){
            if(s[id]!=mn+i-idm){
                return 0;
            }
        }
    }
    return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  return -2;
}

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

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory 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

# Verdict Execution time Memory 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 10 ms 2244 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 18 ms 3860 KB Output is correct
9 Correct 6 ms 1372 KB Output is correct
10 Correct 27 ms 4664 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory 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 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 10 ms 2140 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 19 ms 3932 KB Output is correct
9 Correct 6 ms 1372 KB Output is correct
10 Correct 23 ms 4440 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 13 ms 2356 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 33 ms 5296 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory 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

# Verdict Execution time Memory 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

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -