oj.uz

답안 #737578

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
737578 2023-05-07T11:19:57 Z Boomyday 곤돌라 (IOI14_gondola) C++17
100 / 100
 28 ms 2756 KB 
//
// 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;
}
*/

Compilation message

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.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 716 KB Output is correct
7 Correct 12 ms 1232 KB Output is correct
8 Correct 9 ms 1108 KB Output is correct
9 Correct 4 ms 468 KB Output is correct
10 Correct 15 ms 1232 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 724 KB Output is correct
7 Correct 12 ms 1336 KB Output is correct
8 Correct 10 ms 1108 KB Output is correct
9 Correct 4 ms 468 KB Output is correct
10 Correct 15 ms 1196 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 6 ms 724 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 14 ms 1236 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 8 ms 1236 KB Output is correct
12 Correct 9 ms 1364 KB Output is correct
13 Correct 13 ms 1256 KB Output is correct
14 Correct 10 ms 1196 KB Output is correct
15 Correct 18 ms 2288 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 304 KB Output is correct

Subtask #8
15.0 / 15.0

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

Subtask #9
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 20 ms 1760 KB Output is correct
10 Correct 14 ms 1592 KB Output is correct
11 Correct 6 ms 764 KB Output is correct
12 Correct 7 ms 896 KB Output is correct
13 Correct 2 ms 468 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 312 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 17 ms 1836 KB Output is correct
10 Correct 14 ms 1544 KB Output is correct
11 Correct 6 ms 804 KB Output is correct
12 Correct 7 ms 844 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 24 ms 2596 KB Output is correct
15 Correct 28 ms 2756 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 17 ms 1832 KB Output is correct
18 Correct 10 ms 1340 KB Output is correct