oj.uz

답안 #282401

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
282401 2020-08-24T11:48:50 Z iliccmarko 곤돌라 (IOI14_gondola) C++14
30 / 100
 35 ms 4600 KB 
#include <bits/stdc++.h>
#include<gondola.h>
using namespace std;
#define ll long long
#define endl "\n"

using namespace std;

int next(int n, int tren)
{
    if(tren == n)
        return 1;
    else
        return tren + 1;
}


int valid(int n, int p[])
{
    map<int, int> m;
    m[p[0]]++;
    for(int i = 1;i<n;i++)
    {
        if(m.find(p[i])!=m.end())
            {
                //cout<<i;
                return 0;
            }
        if(p[i]==1&&p[i-1]<n)
            {
                //cout<<i;
                return 0;
            }
        else if(p[i]!=1&&p[i]-1!=p[i-1]&&p[i-1]<=n&&p[i]<=n)
            {
                //cout<<i;
                return 0;
            }
        m[p[i]]++;
    }
    return 1;
}

int replacement(int n, int qs[], int rs[])
{
    int val;
    int ind = -1;;
    for(int i = 0;i<n;i++)
    {
        if(qs[i]<=n)
        {
            ind = i;
            val = qs[i];
            break;
        }
    }
    if(ind == -1)
    {
        for(int i = 0;i<n;i++)
            rs[i] = i + 1;
        return n;
    }
    int i = 0;
    int ans = 0;
    int j = ind + 1;
    while(j!=ind)
    {
        if(j==n)
        {
            j = 0;
            continue;
        }
        int ne = next(n, val);
        if(qs[j]!=ne)
        {
            rs[i] = ne;
            ans++;
        }
        val = ne;
        j++;
    }
    return ans;
}

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

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 15 ms 2176 KB Output is correct
7 Correct 12 ms 640 KB Output is correct
8 Correct 29 ms 3960 KB Output is correct
9 Correct 9 ms 1536 KB Output is correct
10 Correct 35 ms 4576 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 16 ms 2176 KB Output is correct
7 Correct 11 ms 640 KB Output is correct
8 Correct 29 ms 3960 KB Output is correct
9 Correct 9 ms 1536 KB Output is correct
10 Correct 35 ms 4600 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 15 ms 1664 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 20 ms 640 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Incorrect 0 ms 384 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Incorrect 1 ms 256 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #7
5.0 / 5.0

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

Subtask #8
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Incorrect 0 ms 384 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Incorrect 0 ms 384 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Incorrect 1 ms 384 KB Output isn't correct
6 Halted 0 ms 0 KB -