oj.uz

답안 #57702

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
57702 2018-07-15T21:04:11 Z FLDutchman 곤돌라 (IOI14_gondola) C++14
25 / 100
 34 ms 2148 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

typedef int INT;

#define mp make_pair
#define pb push_back
#define fst first
#define snd second
#define int long long
#define MMAX 16384
#define fast_io() ios::sync_with_stdio(false)
#define FOR(i, l, r) for(int i = (l); i < (r); i++)

typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef set<int> si;
typedef double ld;
typedef pair<ld, ld> dd;

const ll INF = 1000000000000000000LL;
const int NMAX = 1e5+4;
const int mod = 1e9+7;
const ld eps = 1e-10;
const ld PI = acos(-1);

INT valid(INT n, INT inputSeq[]){
    int k = -1;
    FOR(i, 0, n) if(inputSeq[i] <= n) {k = i; break;} 
    if(k == -1) {
        sort(inputSeq, inputSeq+n);
        FOR(i, 0, n-1) if(inputSeq[i] == inputSeq[i+1]) return false;
        return true;
    }
    int pos = (k-inputSeq[k]+1+n)%n;
    rotate(inputSeq, inputSeq+pos, inputSeq+n);
    vi tmp;
    FOR(i, 0, n) tmp.pb(inputSeq[i]);
    sort(tmp.begin(), tmp.end());
    FOR(i, 0, n-1) if(tmp[i] == tmp[i+1]) return false;
    FOR(i, 0, n){
        if(inputSeq[i] <= n and inputSeq[i] != i+1) return false; 
    }
    return true;
}

INT replacement(INT n, INT gondolaSeq[], INT replacementSeq[]){
    valid(n, gondolaSeq);
    vii seq(n);
    FOR(i, 0, n) seq[i] = {gondolaSeq[i], i+1};
    sort(&seq[0], &seq[n]);
    int j = n+1;
    vi ret;
    FOR(i, 0, n){
        while(seq[i].fst != seq[i].snd) ret.pb(seq[i].snd), seq[i].snd = j++;
    }
    FOR(i, 0, ret.size()) replacementSeq[i] = ret[i];
    return ret.size();
}

INT countReplacement(INT n, INT inputSeq[]){

}
/*
signed main(){
    int n;
    INT seq[NMAX], outSeq[NMAX];
    cin >> n;
    FOR(i, 0, n) cin >> seq[i];
    int l = replacement(n, seq, outSeq);
    FOR(i, 0, l) cout << outSeq[i] << " ";
    cout << endl;
    fast_io();
}*/

Compilation message

gondola.cpp: In function 'INT replacement(INT, INT*, INT*)':
gondola.cpp:14:41: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define FOR(i, l, r) for(int i = (l); i < (r); i++)
                                         ^
gondola.cpp:61:5: note: in expansion of macro 'FOR'
     FOR(i, 0, ret.size()) replacementSeq[i] = ret[i];
     ^~~
gondola.cpp: In function 'INT countReplacement(INT, INT*)':
gondola.cpp:67:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 640 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 2 ms 640 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 3 ms 676 KB Output is correct
6 Correct 8 ms 1344 KB Output is correct
7 Correct 23 ms 2020 KB Output is correct
8 Correct 14 ms 2144 KB Output is correct
9 Correct 6 ms 2144 KB Output is correct
10 Correct 15 ms 2144 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2144 KB Output is correct
2 Correct 2 ms 2144 KB Output is correct
3 Correct 2 ms 2144 KB Output is correct
4 Correct 2 ms 2144 KB Output is correct
5 Correct 2 ms 2144 KB Output is correct
6 Correct 8 ms 2144 KB Output is correct
7 Correct 27 ms 2144 KB Output is correct
8 Correct 16 ms 2144 KB Output is correct
9 Correct 6 ms 2144 KB Output is correct
10 Correct 20 ms 2148 KB Output is correct
11 Correct 3 ms 2148 KB Output is correct
12 Correct 3 ms 2148 KB Output is correct
13 Correct 14 ms 2148 KB Output is correct
14 Correct 3 ms 2148 KB Output is correct
15 Correct 34 ms 2148 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 5.0

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

Subtask #8
0 / 15.0

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

Subtask #9
0 / 15.0

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

Subtask #10
0 / 10.0

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