oj.uz

Submission #775255

# Submission time Handle Problem Language Result Execution time Memory
775255 2023-07-06T09:05:51 Z boris_mihov Gondola (IOI14_gondola) C++17
20 / 100
 35 ms 4688 KB 
#include "gondola.h"
#include <algorithm>
#include <iostream>
#include <cassert>
#include <numeric>
#include <vector>
#include <set>

typedef long long llong;
const int MAXNUM = 250000 + 10;
const int MAXN = 100000 + 10;
const int INF  = 1e9;

std::set <int> s;

int n;
int getPosDiff(int last, int curr)
{
    if (last > curr)
    {
        return n - last + curr;
    }

    return curr - last;
}

int valid(int N, int inputSeq[])
{
    n = N;
    int minPos = 0;
    for (int i = 1 ; i < n ; ++i)
    {
        if (s.count(inputSeq[i]))
        {
            return 0;
        }

        s.insert(inputSeq[i]);
        if (inputSeq[i] < inputSeq[minPos])
        {
            minPos = i;
        }
    }

    if (inputSeq[minPos] > n)
    {
        return 1;
    }

    for (int i = minPos - 1 ; i >= std::max(0, minPos - inputSeq[minPos] + 1) ; --i)
    {
        if (inputSeq[i] <= n)
        {
            return 0;
        }
    }

    if (minPos + 1 < inputSeq[minPos])
    {
        for (int i = n - 1 ; i >= n + minPos + 1 - inputSeq[minPos] ; --i)
        {
            if (inputSeq[i] <= n)
            {
                return 0;
            }
        }
    }

    int lastPos = minPos;
    int last = inputSeq[minPos];
    for (int i = minPos + 1 ; i < n ; ++i)
    {
        if (inputSeq[i] <= n)
        {
            if (last > inputSeq[i])
            {
                return 0;
            }
            
            if (getPosDiff(lastPos, i) != inputSeq[i] - last)
            {
                return 0;
            }

            last = inputSeq[i];
            lastPos = i;
        }
    }

    for (int i = 1 ; i < minPos ; ++i)
    {
        if (inputSeq[i] <= n)
        {
            if (last > inputSeq[i])
            {
                return 0;
            }
            
            if (getPosDiff(lastPos, i) != inputSeq[i] - last)
            {
                return 0;
            }

            last = inputSeq[i];
            lastPos = i;
        }
    }

    return 1;
}

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

int a[MAXN];
int res[MAXNUM];
int sorted[MAXN];
int replacement(int N, int gondolaSeq[], int replacementSeq[])
{
    n = N;
    int minPos = 0;
    for (int i = 1 ; i < n ; ++i)
    {
        if (gondolaSeq[i] < gondolaSeq[minPos])
        {
            minPos = i;
        }
    }

    int cnt = gondolaSeq[minPos];
    for (int i = minPos ; i < n ; ++i)
    {
        a[i] = cnt++;
        if (cnt == n + 1)
        {
            cnt = 1;
        }
    }

    for (int i = 0 ; i < minPos ; ++i)
    {
        a[i] = cnt++;
        if (cnt == n + 1)
        {
            cnt = 1;
        }
    }

    std::iota(sorted, sorted + n, 0);
    std::sort(sorted, sorted + n, [&](int x, int y)
    {
        return gondolaSeq[x] < gondolaSeq[y];
    });

    int len = 0, reached = n;
    for (int i = 0 ; i < n ; ++i)
    {
        while (gondolaSeq[sorted[i]] > reached)
        {
            replacementSeq[len++] = sorted[i];
            reached++;
        }
    }

    return len;
}

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

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

Subtask #1
5.0 / 5.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 1 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 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 10 ms 2132 KB Output is correct
7 Correct 7 ms 596 KB Output is correct
8 Correct 19 ms 3952 KB Output is correct
9 Correct 6 ms 1372 KB Output is correct
10 Correct 26 ms 4436 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 1 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 13 ms 2200 KB Output is correct
7 Correct 6 ms 596 KB Output is correct
8 Correct 20 ms 3900 KB Output is correct
9 Correct 6 ms 1488 KB Output is correct
10 Correct 26 ms 4436 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 12 ms 2096 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 35 ms 4688 KB Output is correct

Subtask #4
0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 5.0

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