oj.uz

Submission #996532

# Submission time Handle Problem Language Result Execution time Memory
996532 2024-06-10T18:45:51 Z hasan2006 Gondola (IOI14_gondola) C++17
10 / 100
 8 ms 3164 KB 
#include <bits/stdc++.h>
#include "gondola.h"

using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define se second
#define fi first
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 5e5 + 9 , mod = 1e9 + 7;
ll a[N] , b[N] , d[N] , c[N] , dp[N] ;

int valid(int n , int inputSeq[]){
    int x = -1 , y , k;
    for(int i = 0; i < n; i++){
        if(inputSeq[i] <= n)
            x = k = i , y = inputSeq[i];
    }
    if(x == -1)
        return 1;
    while((x + 1) != k){
        x = (x + 1) % n;
        y++;
        y = (y - 1) % n + 1;
        if(inputSeq[x] <= n && inputSeq[x] != y)
            return 0;
    }
    return 1;
}


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

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

/*
int main(){
    int a[] = {2 , 3 , 6 , 1};
    cout<<valid(4 , a);
}*/
// Author : حسن

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 3 ms 2652 KB Output is correct
7 Correct 6 ms 3164 KB Output is correct
8 Correct 5 ms 2864 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 8 ms 3120 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 3 ms 2700 KB Output is correct
7 Correct 6 ms 3164 KB Output is correct
8 Correct 6 ms 2856 KB Output is correct
9 Correct 2 ms 2608 KB Output is correct
10 Correct 6 ms 2908 KB Output is correct
11 Incorrect 0 ms 2396 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 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 2440 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 1 ms 2396 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 2396 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 1 ms 2396 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 1 ms 2396 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 2392 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -