oj.uz

답안 #1064105

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1064105 2024-08-18T09:19:33 Z damjandavkov 곤돌라 (IOI14_gondola) C++17
55 / 100
 16 ms 6236 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int valid(int n, int v[])
{
    int i, x = -1, y;
    vector<bool> w(250000, 0);
    for (i = 0; i < n; i++)
    {
        v[i]--;
        if (w[v[i]])
            return 0;
        w[v[i]] = 1;
        if (v[i] < n)
        {
            y = v[i] - i;
            if (y < 0)
                y += n;
            if (x == -1)
                x = y;
            if (x != y)
                return 0;
        }
    }
    return 1;
}
int replacement(int n, int v[], int rS[])
{
    int i, x = -1, y, t = n, j = 0;
    vector<bool> w(250000, 0);
    vector<vector<int> > in(n);
    for (i = 0; i < n; i++)
    {
        v[i]--;
        if (w[v[i]])
            return 0;
        w[v[i]] = 1;
        if (v[i] < n)
        {
            y = v[i] - i;
            if (y < 0)
                y += n;
            if (x == -1)
                x = y;
            if (x != y)
                return 0;
        }
    }
    if (x == -1)
        x = 0;
    for (i = 0; i < n; i++)
        in[(i + x) % n] = {v[i], (i + x) % n};
    sort(in.begin(), in.end());
    for (i = 0; i < n; i++)
    {
        if (in[i][0] < n)
            continue;
        rS[j] = in[i][1] + 1;
        j++;
        t++;
        while (t <= in[i][0])
        {
            rS[j] = t;
            j++;
            t++;
        }
    }
    return j;
}
int countReplacement(int n, int v[])
{
    return -3;
}

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 348 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
10.0 / 10.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 444 KB Output is correct
6 Correct 3 ms 856 KB Output is correct
7 Correct 6 ms 1224 KB Output is correct
8 Correct 5 ms 1116 KB Output is correct
9 Correct 2 ms 688 KB Output is correct
10 Correct 6 ms 1116 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 3 ms 716 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 6 ms 1116 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 440 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 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 1 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 0 ms 348 KB Output is correct
8 Correct 0 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
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 444 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 600 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 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 11 ms 5468 KB Output is correct
12 Correct 13 ms 6236 KB Output is correct
13 Correct 16 ms 2908 KB Output is correct
14 Correct 11 ms 5468 KB Output is correct
15 Correct 14 ms 2768 KB Output is correct

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 1 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 -