#503319 (C++17) No.1097 Remainder Operation

提出ソース

結果

問題	No.1097 Remainder Operation
ユーザー	raoZ
提出日時	2020-06-26 22:11:45
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,835 bytes
コンパイル時間	1,899 ms
コンパイル使用メモリ	151,992 KB
実行使用メモリ	27,392 KB
最終ジャッジ日時	2024-07-04 21:34:07
合計ジャッジ時間	5,700 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	2 ms 6,944 KB
testcase_07	AC	19 ms 6,944 KB
testcase_08	AC	19 ms 6,940 KB
testcase_09	AC	19 ms 6,944 KB
testcase_10	AC	20 ms 6,944 KB
testcase_11	AC	20 ms 6,944 KB
testcase_12	AC	173 ms 27,392 KB
testcase_13	AC	173 ms 27,392 KB
testcase_14	AC	172 ms 27,392 KB
testcase_15	AC	178 ms 27,392 KB
testcase_16	AC	173 ms 27,392 KB
testcase_17	AC	171 ms 27,392 KB
testcase_18	AC	169 ms 27,392 KB
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<time.h>
#include<random>
#include<array>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, a, b) for(int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
using pii = pair<int,int>;
using piii = pair<pii,int>;
using pll = pair<long long, long long>;
using plll = pair<pll, long long>;
// #pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define isSquare(x) (sqrt(x)*sqrt(x) == x)
template<class T>inline bool chmax(T &a, const T &b) {if(a<b){a = b; return 1;} return 0; };
template<class T>inline bool chmin(T &a, const T &b) {if(a>b){a = b; return 1;} return 0; };
inline void in(void){return;}
template <typename First, typename... Rest> void in(First& first, Rest&... rest){cin >> first;in(rest...);return;}
inline void out(void){cout << "\n";return;}
template <typename First, typename... Rest> void out(First first, Rest... rest){cout << first << " ";out(rest...);return;}
const double EPS = 1e-9;
const int mod = 1e9 + 7;
// const int mod = 998244353;
const int INF = 1e9;
const long long INFLL = 1e18;
void iosetup() {
    cin.tie(nullptr);ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
}
template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
    os << p.first << " " << p.second;
    return os;
}
template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
    is >> p.first >> p.second;
    return is;
}
template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
    for(int i = 0; i < (int) v.size(); i++) {
        os << v[i] << (i + 1 != v.size() ? " " : "");
    }
    return os;
}
template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
    for(T &in : v) is >> in;
    return is;
}
template<class T> vector<T> make_vec(size_t a) {return vector<T>(a); }
template<class T, class... Ts> auto make_vec(size_t a, Ts... ts){
    return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S, T>& t){return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S, T>& t){return pair<S,T>(s.first-t.first, s.second-t.second);}
template<class S, class T> pair<S,T> operator*(const pair<S,T> &s, const S& t){return pair<S,T>(s.first*t, s.second*t);}
template <typename T> void Exit(T first){cout << first << endl;exit(0); };
template< int mod > struct ModInt {
    unsigned x; ModInt() : x(0) {}
    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}
    ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}
    ModInt &operator*=(const ModInt &p) {x = (int) (1LL * x * p.x % mod);return *this;}
    ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}
    ModInt operator-() const { return ModInt(-x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }
    ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); }return ModInt(u);}
    ModInt pow(int64_t n) const {ModInt ret(1), mul(x); while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}
    friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x;}
    friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); }
    static int get_mod() { return mod; }
}; using modint = ModInt< mod >;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const pii dxy[4] = {pii(1,0), pii(0, 1), pii(-1, 0), pii(0, -1)};
bool range(int a, int b, int x){if(a <= x and x < b)return true;else return false;}
bool range(int a, int b, int c, int d, pii p){if(a <= p.first and p.first < b and c <= p.second and p.second < d) return true;else return false;}

// https://ei1333.github.io/luzhiled/snippets/memo/doubling.html
struct Doubling
{
    const int LOG;
    vector< vector< int > > table;

    Doubling(int sz, int64_t lim_t) : LOG(64 - __builtin_clzll(lim_t))
    {
        table.assign(LOG, vector< int > (sz, -1));
    }

    void set_next(int k, int x)
    {
        table[0][k] = x;
    }

    void build(){
        for(int k = 0; k + 1 < LOG; k++){
            for(int i = 0; i < table[k].size(); i++){
                if(table[k][i] == -1) table[k+1][i] = -1;
                else table[k+1][i] = table[k][table[k][i]];
            }
        }
    }

    int query(int k, int64_t t){
        for(int i = LOG - 1; i >= 0; i--){
            if((t >> i) & 1) k = table[i][k];
        }
        return k;
    }
};
// Doubling D(N, 1e18);
// rep(i, 0, N) D.set_next(i, A[i]-1);
// D.build();
// cout << D.query(0, K) + 1 << endl;
int main(){
    iosetup();
    int n; cin >> n;
    vector<int> a(n); cin >> a;
    Doubling D(n, 1e18);
    rep(i, 0, n) D.set_next(i, (i + a[i]) % n);
    D.build();
    vector<ll> cycle;
    ll X = 0;
    set<int> st;
    int idx = 0;
    map<int,int> MP;
    while(st.find(a[X%n]) == st.end()){
        cycle.emplace_back(X);
        int r = X % n;
        MP[r] = idx++;
        st.insert(a[r]);
        X += a[r];
    }
    ll S = X - cycle[MP[X % n]];
    int cnt = cycle.size() - MP[X%n];
    int ist = MP[X%n];
    int Q; cin >> Q;
    // cerr << X << endl;
    // cerr << cycle << endl;
    while(Q--){
        ll K; cin >> K;
        if(K < cycle.size()) cout << cycle[K] << endl;
        else{
            ll ans = X;
            K -= cycle.size();
            ans += S * (K/cnt) + cycle[ist + K%cnt] - cycle[ist];
            cout << ans << endl;
        }
        // cout << (K / cnt) * cycle.back() + cycle[K%cnt] << endl;
    }

    return 0;
}

yukicoder

結果

テストケース

ソースコード