oj.uz

답안 #1026845

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1026845 2024-07-18T12:19:43 Z MarwenElarbi 곤돌라 (IOI14_gondola) C++17
10 / 100
 32 ms 4716 KB 
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
#define pb push_back
#define se second
#define fi first
const int nax=5e5+5;
const int MOD=1e9+7;
vector<pair<int,int>> tab;
int valid(int n, int inputSeq[])
{
    set<int> st;
    for (int i = 0; i < n; ++i)
    {
        st.insert(i+1);
    }
    bool test=true;
    bool nabba=false;
    for (int i = 0; i < n; ++i)
    {
        if(inputSeq[i]<=n){
            st.erase(inputSeq[i]);
        }
    }
    for (int i = 0; i < n; ++i)
    {
        if(inputSeq[i]<=n){
            int cnt=inputSeq[i]-1;
            for (int j = i-1; j >= 0 && inputSeq[j]>n ; --j)
            {
                if(cnt==0) cnt=n;
                if(!st.count(cnt)){
                    test=false;
                }
                st.erase(cnt);
                inputSeq[j]=cnt;
                cnt--;
            }
        }
    }
    for (int i = 0; i < n-1; ++i)
    {
        if(inputSeq[i]>n) break;
        if(inputSeq[i]<inputSeq[i+1]&&inputSeq[i+1]-inputSeq[i]>1) test=false;
        if(inputSeq[i]>inputSeq[i+1]&&(inputSeq[i]!=n||inputSeq[i+1]!=1)){
            test=false;
        }
    }
    return test;
}
 
//----------------------
 
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:18:10: warning: unused variable 'nabba' [-Wunused-variable]
   18 |     bool nabba=false;
      |          ^~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 600 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 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 9 ms 2288 KB Output is correct
7 Correct 31 ms 4716 KB Output is correct
8 Correct 19 ms 3928 KB Output is correct
9 Correct 5 ms 1368 KB Output is correct
10 Correct 22 ms 4652 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 9 ms 2140 KB Output is correct
7 Correct 32 ms 4700 KB Output is correct
8 Correct 19 ms 3932 KB Output is correct
9 Correct 5 ms 1372 KB Output is correct
10 Correct 24 ms 4632 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 9 ms 2140 KB Output is correct
14 Incorrect 0 ms 348 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Integer -2 violates the range [0, 350000]
2 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 -