oj.uz

Submission #1023465

# Submission time Handle Problem Language Result Execution time Memory
1023465 2024-07-14T19:18:36 Z mindiyak Gondola (IOI14_gondola) C++14
25 / 100
 23 ms 4932 KB 
#include "gondola.h"
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000009;

int valid(int n, int arr[])
{
    int mini = arr[0],min_pos = 0;
    FOR(i,1,n){
        if(arr[i] < mini){
            mini = arr[i];
            min_pos = i;
        }
    }

    set<int> counter;
    FOR(i,min_pos,min_pos+n){
        if(counter.count(arr[i%n]))return 0;
        counter.insert(arr[i%n]);
        if(arr[i%n] > n)continue;
        if(arr[i%n] != mini+i-min_pos)return 0;
    }
    return 1;
}

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

int replacement(int n, int arr[], int replacementSeq[])
{ 
    int mini = arr[0],min_pos = 0,cnt = 0,maxi = arr[0];
    FOR(i,1,n){
        maxi = max(maxi,arr[i]);
        if(arr[i] < mini){
            mini = arr[i];
            min_pos = i;
        }
    }
    set<int> counter;

    FOR(i,min_pos,min_pos+n){
        if(counter.count(arr[i%n]))return 0;
        counter.insert(arr[i%n]);
        if(arr[i%n] > n)continue;
        if(arr[i%n] != mini+i-min_pos)return 0;
    }

    FOR(i,1,maxi+1){
        if(counter.count(i))continue;
        replacementSeq[cnt] = i;
        cnt++;
    }

    return cnt;
}

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

int countReplacement(int n, int inputSeq[])
{


  
}

Compilation message

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:99:1: warning: no return statement in function returning non-void [-Wreturn-type]
   99 | }
      | ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 444 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 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 10 ms 2340 KB Output is correct
7 Correct 6 ms 1116 KB Output is correct
8 Correct 21 ms 4268 KB Output is correct
9 Correct 5 ms 1628 KB Output is correct
10 Correct 22 ms 4932 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 344 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 2392 KB Output is correct
7 Correct 6 ms 1116 KB Output is correct
8 Correct 23 ms 4432 KB Output is correct
9 Correct 6 ms 1628 KB Output is correct
10 Correct 23 ms 4932 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 6 ms 1116 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory 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 360 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 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 Incorrect 1 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 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 344 KB Output is correct
7 Incorrect 1 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 0 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -