oj.uz

답안 #285508

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
285508 2020-08-29T07:46:49 Z erd1 곤돌라 (IOI14_gondola) C++14
20 / 100
 42 ms 4736 KB 
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define pb push_back
typedef int64_t lld;
typedef pair<int, int> pii;
typedef long double ld;

int valid(int n, int inputSeq[]) {
  set<int> uses, xs;
  for(int i = 0; i < n; i++)xs.insert(inputSeq[i]);
  if(xs.size() != n)return 0;
  if(*xs.begin() > n)return 1;
  rotate(inputSeq, find(inputSeq, inputSeq+n, *xs.begin()), inputSeq+n);
  assert(*xs.begin() == inputSeq[0]);
  if(*xs.begin() != 1) rotate(inputSeq, inputSeq+(n-*xs.begin()+1), inputSeq+n);
  for(int i = 0; i < n; i++)
    if(inputSeq[i] == i+1) continue;
    else if(inputSeq[i] <= n)return 0; else if(uses.count(inputSeq[i])) return 0; else uses.insert(inputSeq[i]);
  return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
  map<int, int> mp;
  for(int i = 0; i < n; i++)if(gondolaSeq[i] > n)mp[gondolaSeq[i]] = i;
  int cur = 0;
  for(auto i: mp){
    int l = i.ss;
    while(cur <= i.ff)
      replacementSeq[cur] = l, l = cur++;
  }
  return cur;
}

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

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

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:15:16: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   15 |   if(xs.size() != n)return 0;
      |      ~~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 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 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 18 ms 2176 KB Output is correct
7 Correct 33 ms 3712 KB Output is correct
8 Correct 25 ms 3968 KB Output is correct
9 Correct 8 ms 1536 KB Output is correct
10 Correct 32 ms 4728 KB Output is correct

Subtask #3
10.0 / 10.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 256 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 13 ms 2176 KB Output is correct
7 Correct 41 ms 3704 KB Output is correct
8 Correct 28 ms 3960 KB Output is correct
9 Correct 8 ms 1536 KB Output is correct
10 Correct 29 ms 4608 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 18 ms 2048 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 42 ms 4736 KB Output is correct

Subtask #4
0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 5.0

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

Subtask #8
0 / 15.0

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

Subtask #10
0 / 10.0

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