제출 #737578

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
737578		Boomyday	곤돌라 (IOI14_gondola)	C++17	100 / 100	28 ms	2756 KiB

gondola

//
// Created by adavy on 2/11/2023.
//
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;

using ll = long long;
using ld = long double;
using db = double;
using str = string; // yay python!

using ii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;

using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vii = vector<ii>;
using vpl = vector<pl>;
using vpd = vector<pd>;

#define tcT template<class T
#define tcTU tcT, class U

tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
tcT> using PR = pair<T,T>;

// pairs
#define mp make_pair
#define f first
#define s second

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define len(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pb push_back
#define eb emplace_back
#define pf push_front

const int MOD = 1e9+9; // 998244353;
const int MX = 2e5+5;
const ll INF = 1e18; // not too close to LLONG_MAX
const ld PI = acos((ld)-1);
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1}; // for every grid problem!!


#include <stdio.h>
#include <assert.h>

struct Modular {
    int value;
    static const int MOD_value = MOD;

    Modular(long long v = 0) { value = v % MOD; if (value < 0) value += MOD;}
    Modular(long long a, long long b) : value(0){ *this += a; *this /= b;}

    Modular& operator+=(Modular const& b) {value += b.value; if (value >= MOD) value -= MOD; return *this;}
    Modular& operator-=(Modular const& b) {value -= b.value; if (value < 0) value += MOD;return *this;}
    Modular& operator*=(Modular const& b) {value = (long long)value * b.value % MOD;return *this;}

    friend Modular mexp(Modular a, long long e) {
        Modular res = 1; while (e) { if (e&1) res *= a; a *= a; e >>= 1; }
        return res;
    }
    friend Modular inverse(Modular a) { return mexp(a, MOD - 2); }

    Modular& operator/=(Modular const& b) { return *this *= inverse(b); }
    friend Modular operator+(Modular a, Modular const b) { return a += b; }
    friend Modular operator-(Modular a, Modular const b) { return a -= b; }
    friend Modular operator-(Modular const a) { return 0 - a; }
    friend Modular operator*(Modular a, Modular const b) { return a *= b; }
    friend Modular operator/(Modular a, Modular const b) { return a /= b; }
    friend std::ostream& operator<<(std::ostream& os, Modular const& a) {return os << a.value;}
    friend bool operator==(Modular const& a, Modular const& b) {return a.value == b.value;}
    friend bool operator!=(Modular const& a, Modular const& b) {return a.value != b.value;}
};
using vm = vector<Modular>;

int valid(int n, int inputSeq[])
{
    vi nums(inputSeq, inputSeq+n);
    trav(i, nums) i--;
    vi snums(nums); sort(all(snums));
    F0R(i, n-1){
        if (snums[i]==snums[i+1]) return 0;
    }
    int check = -1;
    F0R(i, n){
        if (nums[i]<n){
            check = (nums[i]-i+n)%n;
        }
    }
    if (check==-1) return 1;
    F0R(i, n){
        if (nums[i]<n) if (nums[i]!=(check+i)%n) return 0;
    }
    return 1;

}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    int rep_ctr = 0;
    int num_ctr = n;
    vi nums(gondolaSeq, gondolaSeq+n);
    trav(i, nums) i--;

    int check = 0;
    F0R(i, n){
        if (nums[i]<n){
            check = (nums[i]-i+n)%n;
        }
    }
    vi orig_seq(n);
    F0R(i, n) orig_seq[i] = (check+i)%n;
    vii toChange;
    F0R(i, n) {
        if (nums[i] != orig_seq[i]) toChange.pb({nums[i], i});
    }
    sort(all(toChange));
    for(auto& [end_v, index]:toChange){
        while (num_ctr<=end_v){
            replacementSeq[rep_ctr] = orig_seq[index]+1;
            rep_ctr++;
            orig_seq[index] = num_ctr;
            num_ctr++;

        }
    }
    return rep_ctr;



}

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

int countReplacement(int n, int inputSeq[])
{
    if (!valid(n, inputSeq)) return 0;

    vi nums(inputSeq, inputSeq+n);
    trav(i, nums) i--;

    Modular ans = n;
    int pos = n;

    F0R(i, n) {
        if (nums[i]<n) ans = 1;
    }

    vi toChange;
    trav(i, nums) if (i>=n) toChange.pb(i);
    sort(all(toChange));

    F0R(i, toChange.size()){
        //cout << i << " " << toChange[i] << endl;
        //cout << Modular(toChange.size()-i) << " " << toChange[i]-pos << endl;
        ans *= mexp(Modular(toChange.size()-i), toChange[i]-pos);
        pos = toChange[i]+1;
    }
    return ans.value;





}


/*
int gondolaSequence[100001];
int replacementSequence[250001];

int main()
{
    int i, n, tag;
    int nr;
    assert(scanf("%d", &tag)==1);
    assert(scanf("%d", &n)==1);
    for(i=0;i< n;i++)
        assert( scanf("%d", &gondolaSequence[i]) ==1);

    switch (tag){
        case 1: case 2: case 3:
            printf("%d\n", valid(n, gondolaSequence));
            break;

        case 4: case 5: case 6:
            nr = replacement(n, gondolaSequence, replacementSequence);
            printf("%d ", nr);
            if (nr > 0)
            {
                for (i=0; i<nr-1; i++)
                    printf("%d ", replacementSequence[i]);
                printf("%d\n", replacementSequence[nr-1]);
            }
            else printf("\n");
            break;

        case 7: case 8: case 9: case 10:
            printf("%d\n",  countReplacement(n, gondolaSequence));
            break;
    }

    return 0;
}
*/

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

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:38:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 | #define FOR(i,a,b) for (int i = (a); i < (b); ++i)
      |                                        ^
gondola.cpp:39:18: note: in expansion of macro 'FOR'
   39 | #define F0R(i,a) FOR(i,0,a)
      |                  ^~~
gondola.cpp:175:5: note: in expansion of macro 'F0R'
  175 |     F0R(i, toChange.size()){
      |     ^~~

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