oj.uz

답안 #39724

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
39724 2018-01-18T02:08:59 Z deletend 곤돌라 (IOI14_gondola) C++14
5 / 100
 0 ms 3848 KB 
#include <bits/stdc++.h>
#include <gondola.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;

#define pb push_back
#define rep(i, a, n) for(int i = (a); i < (n); i++)
#define mod (ll)(1e9+7)

__attribute__((constructor))
void initial() {
  cin.tie(0);
  ios::sync_with_stdio(false);
}

int valid(int n, int inputSeq[]) {
  int d = 0, z = -1;
  map<int, int> mp;
  rep(i, 0, n) {
    if(mp[inputSeq[i]]) return 0;
    mp[inputSeq[i]] = 1;
    if(inputSeq[i] < n) {
      if(z > inputSeq[i]) {
        if(d) return 0;
        else d = 1;
      }else {
        if(z + 1 != inputSeq[i]) return 0;
      }
      z = inputSeq[i];
    }
  }
  return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
  map<int, int> mp;
  int mx = 0;
  rep(i, 0, n) {
    mx = max(mx, gondolaSeq[i]);
    mp[gondolaSeq[i]] = 1;
  }
  int ri = 0;
  rep(i, 1, mx) {
    if(!mp[i]) {
      replacementSeq[ri] = i;
      ri++;
    }
  }
  return ri;
}

int countReplacement(int n, int inputSeq[]) {
  if(!valid(n, inputSeq)) return 0;
  int r[100001];
  if(replacement(n, inputSeq, r) <= n) return 1;

  vector<int> v;
  int no = 0;
  rep(i, 0, n) {
    if(inputSeq[i] > n) v.pb(i);
    else no++;
  }
  return 1;
}
//
// int main() {
//   int n;
//   cin >> n;
//
//   int c[10], h[10], p[10];
//   rep(i, 0, n) cin >> c[i];
//   rep(i, 1, n) cin >> h[i] >> p[i];
//   cout << findSample(n, c, h, p) << endl;
// }

Subtask #1
0 / 5.0

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

Subtask #2
0 / 5.0

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

Subtask #3
0 / 10.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 5.0

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

Subtask #8
0 / 15.0

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

Subtask #9
0 / 15.0

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

Subtask #10
0 / 10.0

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