結果
問題 | No.1120 Strange Teacher |
ユーザー |
![]() |
提出日時 | 2020-07-22 21:33:56 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 22 ms / 1,000 ms |
コード長 | 2,860 bytes |
コンパイル時間 | 2,001 ms |
コンパイル使用メモリ | 195,168 KB |
最終ジャッジ日時 | 2025-01-12 02:16:59 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 27 |
ソースコード
#include <bits/stdc++.h> #define _GLIBCXX_DEBUG using namespace std; using ll = long long; using ld = long double; using V = vector<int>; using Vll = vector<ll>; using Vld = vector<ld>; using Vbo = vector<bool>; using VV = vector<V>; using VVll = vector<Vll>; using VVld = vector<Vld>; using VVbo = vector<Vbo>; using VVV = vector<VV>; using VVVll = vector<VVll>; using P = pair<int, int>; using Pll = pair<ll, ll>; using Pld = pair<ld, ld>; #define rep2(i, m, n) for (int i = (m); i < (n); ++i) #define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i) #define rep(i, n) rep2(i, 0, n) #define drep(i, n) drep2(i, n, 0) #define all(a) (a).begin(), (a).end() struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; template<typename T> inline int sz(T &x) { return x.size(); } template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; } template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; } template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &e : v) is >> e; return is; } template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; } template<typename T> inline int count_between(vector<T> &a, T l, T r) { return lower_bound(all(a), r) - lower_bound(all(a), l); } // [l, r) inline int fLog2(const int x) { return 31-__builtin_clz(x); } // floor(log2(x)) inline int fLog2(const ll x) { return 63-__builtin_clzll(x); } inline int cLog2(const int x) { return (x == 1) ? 0 : 32-__builtin_clz(x-1); } // ceil(log2(x)) inline int cLog2(const ll x) { return (x == 1) ? 0 : 64-__builtin_clzll(x-1); } inline int popcount(const int x) { return __builtin_popcount(x); } inline int popcount(const ll x) { return __builtin_popcountll(x); } const int INF = 1<<30; const ll INFll = 1ll<<62; const ld EPS = 1e-10; const ld PI = acos(-1.0); // const int MOD = int(1e9)+7; // const int MOD = 998244353; int main() { ll n; cin >> n; Vll a(n), b(n); cin >> a >> b; ll sa = 0; ll sb = 0; rep(i, n) sa += a[i]; rep(i, n) sb += b[i]; if (n == 2) { if (sa != sb) cout << -1 << '\n'; else cout << abs(a[0] - b[1]) << '\n'; return 0; } if (sa < sb && (sa-sb) % (n-2) != 0) { cout << -1 << '\n'; return 0; } ll k = (sa-sb) / (n-2); rep(i, n) { ll x = b[i] - a[i] + k; if (x < 0 || x % 2 == 1) { cout << -1 << '\n'; return 0; } } cout << k << '\n'; return 0; }