oj.uz

답안 #239892

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
239892 2020-06-17T12:50:02 Z abacaba 곤돌라 (IOI14_gondola) C++14
20 / 100
 63 ms 5908 KB 
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include "gondola.h"
#include <cstring>
#include <chrono>
#include <vector>
#include <map>
#include <random>
#include <set>
#include <algorithm>
#include <math.h>
#include <cstdio>
#include <stdio.h>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <deque>
#include <cassert>
#include <stack>
using namespace std;

#define mp make_pair
#define f first
#define se second
#define pb push_back
#define ppb pop_back
#define emb emplace_back
#define ll long long
#define ull unsigned long long
#define cntbit(x) __builtin_popcount(x)
#define endl '\n'
#define uset unordered_set
#define umap unordered_map
#define pii pair<int, int>
#define ld long double
#define pll pair<long long, long long>

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template <typename T> inline T range(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}

inline void setin(string s) {
    freopen(s.c_str(), "r", stdin);
}

inline void setout(string s) {
    freopen(s.c_str(), "w", stdout);
}

template <typename T> void Min(T &a, T b) {
    a = min(a, b);
}

template <typename T> void Max(T &a, T b) {
    a = max(a, b);
}

const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int N = 3e5 + 15;

int a[N], b[N];

int valid(int n, int inputSeq[]) {
    map <int, int> cnt = {};
    for(int i = 0; i < n; ++i) {
        a[i] = inputSeq[i] - 1;
        if(cnt[a[i]])
            return 0;
        ++cnt[a[i]];
    }
    for(int i = 0; i < n; ++i) {
        if(a[i] < n) {
            int cnt = a[i];
            for(int j = i; j < n; ++j, cnt = (cnt + 1) % n)
                b[j] = cnt;
            for(int j = 0; j < i; ++j, cnt = (cnt + 1) % n)
                b[j] = cnt;
            break;
        }
    }
    for(int i = 0; i < n; ++i)
        if(a[i] < n && b[i] < n && a[i] != b[i])
            return 0;
    return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  return -2;
}

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 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 384 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 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 20 ms 2560 KB Output is correct
7 Correct 17 ms 768 KB Output is correct
8 Correct 33 ms 4480 KB Output is correct
9 Correct 12 ms 1664 KB Output is correct
10 Correct 40 ms 5240 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 19 ms 2560 KB Output is correct
7 Correct 17 ms 896 KB Output is correct
8 Correct 33 ms 4472 KB Output is correct
9 Correct 14 ms 1664 KB Output is correct
10 Correct 42 ms 5376 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 24 ms 2688 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 63 ms 5908 KB Output is correct

Subtask #4
0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 5.0

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

Subtask #8
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 #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 6 ms 640 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -