제출 #1023474

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1023474		mindiyak	Gondola (IOI14_gondola)	C++14	20 / 100	25 ms	5164 KiB

gondola

#include "gondola.h"
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000009;

int valid(int n, int arr[])
{
    int mini = arr[0],min_pos = 0;
    FOR(i,1,n){
        if(arr[i] < mini){
            mini = arr[i];
            min_pos = i;
        }
    }

    set<int> counter;
    FOR(i,min_pos,min_pos+n){
        if(counter.count(arr[i%n]))return 0;
        counter.insert(arr[i%n]);
        if(arr[i%n] > n)continue;
        if(arr[i%n] != mini+i-min_pos)return 0;
    }
    return 1;
}

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

int replacement(int n, int arr[], int replacementSeq[])
{ 
    if(valid(n,arr) == 0) return 0;

    int mini = arr[0],min_pos = 0,maxi = arr[0],cnt = 0;
    set<int> counter;
    priority_queue<pi> pq;
    
    FOR(i,0,n){
        counter.insert(arr[i]);
        maxi = max(maxi,arr[i]);
        if(arr[i] < mini){
            mini = arr[i];
            min_pos = i;
        }
    }

    if(min_pos-(mini-1) < 0)min_pos += n;
    min_pos -= mini-1;

    FOR(i,min_pos,min_pos+n){
        if(arr[i%n] > n){
            pq.push({-arr[i%n],(mini+i-min_pos)});
        }
    }
    
    while(!pq.empty()){
        auto a = pq.top();pq.pop();
        a.F *= -1;
        // cout << a.F << endl;
        replacementSeq[cnt] = a.S;
        cnt++;
        FOR(i,max(a.S+1,n+1),a.F){
            if(counter.count(i))continue;
            // cout <<i << " " << a.S << endl;
            pq.push({-a.F,i});
        }
    }

    return cnt;
}

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

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


  
}

컴파일 시 표준 에러 (stderr) 메시지

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:113:1: warning: no return statement in function returning non-void [-Wreturn-type]
  113 | }
      | ^

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 0 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10