oj.uz

Submission #166607

# Submission time Handle Problem Language Result Execution time Memory
166607 2019-12-03T04:32:08 Z TAISA_ Gondola (IOI14_gondola) C++14
10 / 100
 7 ms 1400 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int valid(int n, int inputSeq[]) {
    int b = -1;
    vector<int> v;
    for (int i = 0; i < n; i++) {
        if (inputSeq[i] <= n) {
            if (b == -1) {
                b = inputSeq[i];
            } else {
                if (b == n) {
                    b = 1;
                } else {
                    b++;
                }
            }
        } else {
            if (b != -1) {
                b++;
            }
            v.push_back(b);
        }
    }
    return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
    int ma = -1;
    vector<int> co(250010), idx(n);
    int id = 0;
    int b = -1;
    for (int i = 0; i < n; i++) {
        if (gondolaSeq[i] <= n) {
            if (b == -1) {
                b = gondolaSeq[i];
                for (int j = i; j < n; j++) {
                    idx[j] = b;
                    b++;
                    if (b == n + 1) {
                        b = 1;
                    }
                }
                for (int j = 0; j < i; j++) {
                    idx[j] = b;
                    b++;
                    if (b == n + 1) {
                        b = 1;
                    }
                }
                break;
            }
        }
    }
    if (b == -1) {
        for (int i = 0; i < n; i++) {
            idx[i] = i + 1;
        }
    }
    for (int i = 0; i < n; i++) {
        if (gondolaSeq[i] > n) {
            ma = max(ma, gondolaSeq[i]);
            replacementSeq[id] = idx[i];
            id++;
            co[gondolaSeq[i]] = 1;
        }
    }
    for (int i = n + 1; i <= ma; i++) {
        if (co[i] == 0) {
            replacementSeq[id] = i;
            id++;
        }
    }
    return id;
}

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

int countReplacement(int n, int inputSeq[]) {
    if (!valid(n, inputSeq)) {
        return 0;
    }
}

Compilation message

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:86:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

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

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1244 KB Output is correct
3 Correct 3 ms 1400 KB Output is correct
4 Correct 3 ms 1272 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 4 ms 1272 KB Output is correct
4 Correct 3 ms 1272 KB Output is correct
5 Correct 3 ms 1276 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Incorrect 3 ms 1272 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 4 ms 1272 KB Output is correct
3 Correct 3 ms 1372 KB Output is correct
4 Correct 3 ms 1272 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 4 ms 1272 KB Output is correct
7 Incorrect 3 ms 1400 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 252 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Incorrect 2 ms 252 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Incorrect 7 ms 376 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Incorrect 2 ms 376 KB Output isn't correct
6 Halted 0 ms 0 KB -