結果

問題 No.2451 Redistribute Integers
ユーザー deuteridayodeuteridayo
提出日時 2023-09-01 21:42:30
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 241 ms / 2,000 ms
コード長 4,152 bytes
コンパイル時間 4,544 ms
コンパイル使用メモリ 266,968 KB
実行使用メモリ 7,552 KB
最終ジャッジ日時 2024-06-11 11:01:57
合計ジャッジ時間 7,802 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 234 ms
7,424 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 164 ms
7,552 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 81 ms
5,376 KB
testcase_13 AC 219 ms
7,424 KB
testcase_14 AC 241 ms
7,552 KB
testcase_15 AC 121 ms
5,376 KB
testcase_16 AC 108 ms
5,376 KB
testcase_17 AC 173 ms
6,272 KB
testcase_18 AC 214 ms
7,552 KB
testcase_19 AC 20 ms
5,376 KB
testcase_20 AC 193 ms
6,528 KB
testcase_21 AC 236 ms
7,424 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using lint = long long;
using ulint = unsigned long long;
using llint = __int128_t;
#define endl '\n'
int const INF = 1<<30;
lint const INF64 = 1LL<<61;
lint const mod107 = 1e9+7;
using mint107 = modint1000000007;
long const mod = 998244353;
using mint = modint998244353;
lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}}
lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}}
lint Sqrt(lint x) {assert(x >= 0); lint ans = sqrt(x); while(ans*ans > x)ans--; while((ans+1)*(ans+1)<=x)ans++; return ans;}
lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;}
lint chmin(vector<lint>&v){lint ans = INF64;for(lint i:v){ans = min(ans, i);}return ans;}
lint chmax(vector<lint>&v){lint ans = -INF64;for(lint i:v){ans = max(ans, i);}return ans;}
double dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}
string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;}
string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}
vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j] <= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}
lint Kai[20000001]; bool firstCallnCr = true; 
lint ncrmodp(lint n,lint r,lint p){ if(firstCallnCr){ Kai[0] = 1; for(int i=1;i<=20000000;i++){ Kai[i] = Kai[i-1] * i; Kai[i] %= mod;} firstCallnCr = false;} if(n<0)return 0;
if(n < r)return 0;if(n==0)return 1;lint ans = Kai[n];lint tmp = (Kai[r] * Kai[n-r]) % p;for(lint i=1;i<=p-2;i*=2){if(i & p-2){ans *= tmp;ans %= p;}tmp *= tmp;tmp %= p;}return ans;}
#define rep(i, n) for(int i = 0; i < n; i++)
#define repp(i, x, y) for(int i = x; i < y; i++)
#define vec vector
#define pb push_back
#define se second
#define fi first
#define all(x) x.begin(),x.end()
struct Frac {
    lint upper, lower;
    Frac() {
        Frac(0,1);
    }
    Frac(lint u, lint l) {
        assert(l != 0);
        if(u <= 0 && l < 0) {
            upper = -u;
            lower = -l;
        } else {
            upper = u;
            lower = l;
        }
        reduction();
    }

    Frac(lint u) {
        upper = u;
        lower = 1;
    } 

    void reduction() {
        if(upper != 0) {
            lint g = gcd(abs(upper), abs(lower));
            upper /= g;
            lower /= g;
        
            if(lower < 0) {
                lower *= -1;
                upper *= -1;
            }
        } else {
            lower = 1;
        }
    }

    Frac operator+(const Frac &other) {
        lint L = lower * other.lower;
        lint U = upper*other.lower + lower*other.upper;
        return Frac(U, L);
    }

    Frac operator-(const Frac &other) {
        lint L = lower * other.lower;
        lint U = upper*other.lower - lower*other.upper;
        upper = U;
        lower = L;
        return Frac(U, L);
    }

    bool operator<=(const Frac &other) {
        return upper*other.lower <= lower*other.upper;
    }

    Frac operator*(const Frac &other) {
        lint L = lower * other.lower;
        lint U = upper * other.upper;
        return Frac(U, L);
    }

    Frac operator/(const Frac &other) {
        assert(other.upper != 0);
        lint L = lower * other.upper;
        lint U = upper * other.lower;
        return Frac(U, L);
    }
};

bool operator<(const Frac &left, const Frac &right) {
    return left.upper*right.lower < left.lower*right.upper;
}
struct edge{
    int to;
};
using graph = vector<vector<edge>>;

int main(){
    lint n;
    cin >> n;
    lint a[n];
    lint s = 0;
    rep(i, n) {
        cin >> a[i];
    }
    sort(a, a+n);
    bool chk = true;
    repp(i,1, n) {
        if((a[i] - a[i-1]) % n != 0) chk = false;
    }
    cout << (chk?"Yes" : "No") << endl;
}
0