結果
| 問題 |
No.1584 Stones around Circle Pond
|
| コンテスト | |
| ユーザー |
Nachia
|
| 提出日時 | 2021-07-02 22:42:35 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 1,706 bytes |
| コンパイル時間 | 2,753 ms |
| コンパイル使用メモリ | 79,264 KB |
| 最終ジャッジ日時 | 2025-01-22 16:33:11 |
|
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 25 WA * 33 |
ソースコード
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
ll N,L;
vector<ll> A;
vector<ll> B;
vector<ll> S;
vector<ll> Cnt;
vector<ll> DistSum;
ll minvec(const vector<ll>& v){
ll x = v[0];
for(ll a : v) x = min(x,a);
return x;
}
ll dist(ll a, ll b){
if(a > b) swap(a,b);
return min(A[b]-A[a],A[a]-A[b]+2*L);
}
int main(){
cin >> N >> L;
A.resize(2*N);
rep(i,N) cin >> A[i];
rep(i,N) A[i+N] = A[i] + L;
A.push_back(L*2+A[0]);
B.resize(2*N);
rep(i,2*N) cin >> B[i];
B.push_back(B[0]);
S.resize(2*N);
rep(i,2*N){
if(abs(B[i+1] - B[i]) % abs(A[i+1] - A[i]) != 0){ cout << "No\n"; return 0; }
S[i] = - (B[i+1] - B[i]) / (A[i+1] - A[i]);
}
DistSum.assign(2*N,0);
rep(i,2*N) rep(j,2*N) DistSum[i] += dist(i,j);
Cnt.assign(2*N+1,0);
Cnt[0] = S[2+N-1];
rep(i,2*N) Cnt[i+1] = Cnt[i] + S[i];
//rep(i,2*N) cout << Cnt[i] << " "; cout << endl;
ll CntDiff = Cnt[N] + Cnt[0];
rep(i,N) if(Cnt[i] + Cnt[i+N] != CntDiff){ cout << "No\n"; return 0; }
if(CntDiff % 2 != 0){ cout << "No\n"; return 0; }
rep(i,2*N) Cnt[i] -= CntDiff / 2;
//rep(i,2*N) cout << Cnt[i] << " "; cout << endl;
rep(i,2*N) rep(j,2*N) if(Cnt[j] >= 0) B[i] -= Cnt[j] * dist(i,j);
//rep(i,2*N) cout << B[i] << " "; cout << endl;
rep(i,2*N) if(B[i] < 0){ cout << "No\n"; return 0; }
rep(i,2*N-1) if(B[i] != B[i+1]){ cout << "No\n"; return 0; }
if(B[0] % L != 0){ cout << "No\n"; return 0; }
cout << "Yes\n";
return 0;
}
struct ios_do_not_sync{
ios_do_not_sync(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
}
} ios_do_not_sync_inst;
Nachia