oj.uz

Submission #1034690

# Submission time Handle Problem Language Result Execution time Memory
1034690 2024-07-25T16:47:41 Z ArthuroWich Gondola (IOI14_gondola) C++17
25 / 100
 25 ms 5916 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int valid(int n, int gondolaSeq[]) {
    int mi = INT_MAX, ind = -1;
    set<int> c;
    for (int i = 0; i < n; i++) {
        c.insert(gondolaSeq[i]);
        if (mi > gondolaSeq[i]) {
            mi = gondolaSeq[i];
            ind = i;
        }
    }
    if (c.size() < n) {
        return 0;
    }
    if (mi > n) {
        return 1;
    }
    ind -= (mi-1);
    ind += n;
    ind %= n;
    vector<int> a;
    for (int i = ind; i < n; i++) {
        a.push_back(gondolaSeq[i]);
    }
    for (int i = 0; i < ind; i++) {
        a.push_back(gondolaSeq[i]);
    }
    for (int i = 0; i < n; i++) {
        if (a[i] <= n && a[i] != i+1) {
            return 0;
        }
    }
    return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
    int mi = INT_MAX, ind = -1, ma = 0;
    set<int> c;
    for (int i = 0; i < n; i++) {
        ma = max(ma, gondolaSeq[i]);
        c.insert(gondolaSeq[i]);
        if (mi > gondolaSeq[i]) {
            mi = gondolaSeq[i];
            ind = i;
        }
    }
    vector<pair<int, int>> num;
    if (ma <= n) {
        return 0;
    }
    if (mi > n) {
        for (int i = 0; i < n; i++) {
            num.push_back({gondolaSeq[i], i+1});
        }
        int l = 0;
        sort(num.begin(), num.end());
        for (int i = 0; i < num.size(); i++) {
            l = max(l, num[i].first-n);
        }
        for (int i = 0; i < l; i++) {
            replacementSeq[i] = num[0].second;
        }
        for (int i = 0; i < num.size(); i++) {
            replacementSeq[num[i].first-n-1] = num[i].second;
        }
        return l;
    } else {
        ind -= (mi-1);
        ind += n;
        ind %= n;
        vector<int> a;
        for (int i = ind; i < n; i++) {
            a.push_back(gondolaSeq[i]);
        }
        for (int i = 0; i < ind; i++) {
            a.push_back(gondolaSeq[i]);
        }
        for (int i = 0; i < n; i++) {
            if (a[i] > n) {
               num.push_back({a[i], i+1});
            }
        }
        int l = 0;
        sort(num.begin(), num.end());
        for (int i = 0; i < num.size(); i++) {
            l = max(l, num[i].first-n);
        }
        for (int i = 0; i < l; i++) {
            replacementSeq[i] = num[0].second;
        }
        for (int i = 0; i < num.size(); i++) {
            replacementSeq[num[i].first-n-1] = num[i].second;
        }
        return l;
    }
}
int countReplacement(int n, int gondolaSeq[]) {
    return 0;
}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:14:18: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   14 |     if (c.size() < n) {
      |         ~~~~~~~~~^~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:58:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |         for (int i = 0; i < num.size(); i++) {
      |                         ~~^~~~~~~~~~~~
gondola.cpp:64:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |         for (int i = 0; i < num.size(); i++) {
      |                         ~~^~~~~~~~~~~~
gondola.cpp:86:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |         for (int i = 0; i < num.size(); i++) {
      |                         ~~^~~~~~~~~~~~
gondola.cpp:92:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |         for (int i = 0; i < num.size(); i++) {
      |                         ~~^~~~~~~~~~~~

Subtask #1
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 344 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 420 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 8 ms 2908 KB Output is correct
7 Correct 20 ms 4188 KB Output is correct
8 Correct 14 ms 5076 KB Output is correct
9 Correct 5 ms 1864 KB Output is correct
10 Correct 18 ms 5672 KB Output is correct

Subtask #3
10.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 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 7 ms 2796 KB Output is correct
7 Correct 24 ms 4300 KB Output is correct
8 Correct 17 ms 4992 KB Output is correct
9 Correct 5 ms 1884 KB Output is correct
10 Correct 18 ms 5648 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 10 ms 2652 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 25 ms 5916 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 348 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 0 ms 348 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 440 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 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 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

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

Subtask #9
0 / 15.0

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

Subtask #10
0 / 10.0

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