oj.uz

Submission #836461

# Submission time Handle Problem Language Result Execution time Memory
836461 2023-08-24T11:34:52 Z Jarif_Rahman Gondola (IOI14_gondola) C++17
55 / 100
 43 ms 10188 KB 
#include "gondola.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

const ll md = 1e9+7;

bool distinct(deque<int> S){
    sort(S.begin(), S.end());
    for(int i = 1; i < S.size(); i++) if(S[i] == S[i-1]) return 0;
    return 1;
}

int valid(int n, int _S[]){
    deque<int> S;
    for(int i = 0; i < n; i++) S.pb(_S[i]);
    int mn = *min_element(S.begin(), S.end());
    while(S[0] != mn) S.pb(S[0]), S.pop_front();

    if(!distinct(S)) return 0;

    for(int i = 1; i < n; i++) if(S[i] <= n){
        if(S[i] != (mn+i-1)%n+1) return 0;
    }

    return 1;
}

int replacement(int n, int _S[], int R[]){
    deque<int> S;
    for(int i = 0; i < n; i++) S.pb(_S[i]);
    int mn = *min_element(S.begin(), S.end());
    while(S[0] != mn) S.pb(S[0]), S.pop_front();

    int mx = *max_element(S.begin(), S.end());
    if(mx == n) return 0;
    int x = (max_element(S.begin(), S.end())-S.begin()+mn-1)%n+1;

    map<int, int> mp;
    for(int i = 0; i < n; i++){
        if(S[i] > n && S[i] != mx) mp[S[i]] = (mn+i-1)%n+1;
    }

    for(int i = n+1; i <= mx; i++){
        if(mp[i] == 0) R[i-n-1] = x, x = i;
        else R[i-n-1] = mp[i];
    }
    return mx-n;
}

int countReplacement(int n, int _S[]){
    deque<int> S;
    for(int i = 0; i < n; i++) S.pb(_S[i]);
    int mn = *min_element(S.begin(), S.end());
    while(S[0] != mn) S.pb(S[0]), S.pop_front();
    return 0;
}

Compilation message

gondola.cpp: In function 'bool distinct(std::deque<int>)':
gondola.cpp:14:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |     for(int i = 1; i < S.size(); i++) if(S[i] == S[i-1]) return 0;
      |                    ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 12 ms 1336 KB Output is correct
8 Correct 7 ms 1108 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 9 ms 1236 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 12 ms 1364 KB Output is correct
8 Correct 7 ms 1108 KB Output is correct
9 Correct 3 ms 480 KB Output is correct
10 Correct 13 ms 1236 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 224 KB Output is correct
13 Correct 6 ms 724 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 18 ms 1360 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 260 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 6 ms 1364 KB Output is correct
12 Correct 7 ms 1452 KB Output is correct
13 Correct 24 ms 4740 KB Output is correct
14 Correct 7 ms 1364 KB Output is correct
15 Correct 43 ms 10188 KB Output is correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -