oj.uz

Submission #70080

# Submission time Handle Problem Language Result Execution time Memory
70080 2018-08-22T10:21:38 Z zubec Gondola (IOI14_gondola) C++14
20 / 100
 27 ms 2540 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 100100;

int a[N];

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

    map<int, int> mp1;
    map<int, int> used, used2;
    for (int i = 1; i <= n; i++){
        a[i] = inputSeq[i-1];
        if (a[i] > n){
            if (++mp1[a[i]] > 1)
                return 0;
        }
    }
    a[n+1] = a[1];
    int prev = 0;
    for (int i = 1; i <= n; i++){
        if (used.find(a[i+1]) != used.end())
            a[i+1] = used[a[i+1]];
        if (a[i] > n)
            continue;
        if (a[i+1] > n){
            if (a[i] == n){
                if (used2.find(1) != used2.end())
                    return 0;
                used[a[i+1]] = 1;
                used2[1] = a[i+1];
                a[i+1] = 1;
            } else {
                if (used2.find(a[i]+1) != used2.end())
                    return 0;
                used[a[i+1]] = a[i]+1;
                used2[a[i]+1] = a[i+1];
                a[i+1] = a[i]+1;
            }
        } else {
            if (a[i] == n){
                if (a[i+1] != 1)
                    return 0;
            } else {
                if (a[i+1] != a[i] + 1)
                    return 0;
            }
        }
    }
    /*for (int i = n+1; i > 1; i--){
        if (used.find(a[i-1]) != used.end())
            a[i-1] = used[a[i-1]];
        if (a[i] > n)
            continue;
        if (a[i-1] > n){
            if (a[i] == 1){
                if (used2.find(n) != used2.end())
                    return 0;
                used[a[i-1]] = n;
                used2[n] = a[i-1];
                a[i-1] = n;
            } else {
                if (used2.find(a[i]-1) != used2.end())
                    return 0;
                used[a[i-1]] = a[i]-1;
                used2[a[i]-1] = a[i-1];
                a[i-1] = a[i]-1;
            }
        } else {
            if (a[i] == 1){
                if (a[i-1] != n)
                    return 0;
            } else {
                if (a[i-1] != a[i] - 1)
                    return 0;
            }
        }
    }*/

    return 1;
}

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

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

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

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

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:21:9: warning: unused variable 'prev' [-Wunused-variable]
     int prev = 0;
         ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 3 ms 484 KB Output is correct
4 Correct 3 ms 548 KB Output is correct
5 Correct 2 ms 548 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 548 KB Output is correct
2 Correct 2 ms 548 KB Output is correct
3 Correct 2 ms 548 KB Output is correct
4 Correct 2 ms 548 KB Output is correct
5 Correct 2 ms 548 KB Output is correct
6 Correct 6 ms 876 KB Output is correct
7 Correct 17 ms 1260 KB Output is correct
8 Correct 11 ms 1260 KB Output is correct
9 Correct 7 ms 1260 KB Output is correct
10 Correct 15 ms 1260 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1260 KB Output is correct
2 Correct 2 ms 1260 KB Output is correct
3 Correct 2 ms 1260 KB Output is correct
4 Correct 2 ms 1260 KB Output is correct
5 Correct 3 ms 1260 KB Output is correct
6 Correct 6 ms 1260 KB Output is correct
7 Correct 13 ms 1260 KB Output is correct
8 Correct 13 ms 1260 KB Output is correct
9 Correct 6 ms 1260 KB Output is correct
10 Correct 18 ms 1260 KB Output is correct
11 Correct 3 ms 1260 KB Output is correct
12 Correct 2 ms 1260 KB Output is correct
13 Correct 23 ms 2540 KB Output is correct
14 Correct 3 ms 2540 KB Output is correct
15 Correct 27 ms 2540 KB Output is correct

Subtask #4
0 / 5.0

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