oj.uz

답안 #230322

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
230322 2020-05-09T14:21:52 Z chubyxdxd 곤돌라 (IOI14_gondola) C++11
20 / 100
 20 ms 672 KB 
#include "gondola.h"
#include <bits/stdc++.h>

using namespace std;
int valid(int n, int inputSeq[])
{
  for(int i=1;i<n;i++){
    if(inputSeq[i]==1 and inputSeq[i-1]!=n)return 0;
    if(inputSeq[i]!=1 and inputSeq[i-1]+1!=inputSeq[i])return 0;
  }
  return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  vector<int> v;
  int maxi=1;
  int ans=0;
  for(int i=0;i<n;i++){
    if(i+1!=gondolaSeq[i]){replacementSeq[0]=i+1;ans=1;}
  }
  //cout<<maxi<<endl;
  //cout<<maxi-n<<endl;
  return ans;
}

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

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

Compilation message

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:19:7: warning: unused variable 'maxi' [-Wunused-variable]
   int maxi=1;
       ^~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 10 ms 512 KB Output is correct
7 Correct 18 ms 640 KB Output is correct
8 Correct 20 ms 640 KB Output is correct
9 Correct 9 ms 512 KB Output is correct
10 Correct 16 ms 640 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 10 ms 512 KB Output is correct
7 Correct 18 ms 640 KB Output is correct
8 Correct 17 ms 672 KB Output is correct
9 Correct 9 ms 384 KB Output is correct
10 Correct 16 ms 640 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 10 ms 512 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 18 ms 640 KB Output is correct

Subtask #4
0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 5.0

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

Subtask #8
0 / 15.0

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

Subtask #9
0 / 15.0

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

Subtask #10
0 / 10.0

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