oj.uz

답안 #1018824

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1018824 2024-07-10T10:03:20 Z amine_aroua 곤돌라 (IOI14_gondola) C++17
35 / 100
 1000 ms 4660 KB 
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
int valid(int n, int inputSeq[])
{
    bool acc = 1;
    set<int> s;
    for(int i = 0 ; i< n ; i++)
    {
        inputSeq[i]--;
        s.insert(inputSeq[i]);
        if(inputSeq[i] < n)
            acc = 0;
    }
    if((int)s.size() != n)
        return 0;
    if(acc)
        return 1;
    for(int i = 0 ; i < n ; i++)
    {
        if(inputSeq[i] < n)
        {
            int j = i;
            int ok = 1;
            do {
                j = (j + 1) % n;
                if (inputSeq[j] >= n)
                    continue;
                if (inputSeq[j] != (inputSeq[i] + j - i + n) % n) {
                    ok = 0;
                    break;
                }
            }
            while(i != j);
            return ok;
        }
    }
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    priority_queue<pair<int, int> , vector<pair<int ,int>> , greater<pair<int, int>>> s;
    vector<int> perm(n);
    for(int i = 0 ; i < n ; i++)
        perm[i] = i;
    for(int i = 0 ; i < n ; i++)
    {
        gondolaSeq[i]--;
        if(gondolaSeq[i] >= n)
            s.push({gondolaSeq[i] , i});
        else
        {
            perm[i] = gondolaSeq[i];
            int j = i;
            do
            {
                j = (j + 1)%n;
                perm[j] = (gondolaSeq[i] + j - i + n)%n;
            } while (i != j);
        }
    }
    vector<int> rep;
    int cnt = n - 1;
    while (!s.empty())
    {
        auto it = s.top();
        int i = it.second;
        int x = it.first;
        int last = perm[i];
        while (cnt < x)
        {
            cnt++;
            rep.push_back(last);
            last = cnt;
        }
        s.pop();
    }
    for(int i = 0 ; i < (int)rep.size() ; i++)
        replacementSeq[i] = rep[i] + 1;
    return (int)rep.size();
}

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

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

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:7:14: warning: control reaches end of non-void function [-Wreturn-type]
    7 |     set<int> s;
      |              ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 8 ms 2140 KB Output is correct
7 Correct 18 ms 3804 KB Output is correct
8 Correct 11 ms 3932 KB Output is correct
9 Correct 7 ms 1484 KB Output is correct
10 Correct 17 ms 4660 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 2140 KB Output is correct
7 Correct 19 ms 3788 KB Output is correct
8 Correct 13 ms 3932 KB Output is correct
9 Correct 4 ms 1372 KB Output is correct
10 Correct 29 ms 4432 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 2140 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 25 ms 4576 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Execution timed out 1036 ms 1116 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -