結果
問題 | No.1120 Strange Teacher |
ユーザー |
|
提出日時 | 2020-07-22 21:27:00 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 29 ms / 1,000 ms |
コード長 | 1,896 bytes |
コンパイル時間 | 1,344 ms |
コンパイル使用メモリ | 126,788 KB |
最終ジャッジ日時 | 2025-01-12 02:08:45 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 27 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:51:17: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 51 | int n; scanf("%d", &n); | ~~~~~^~~~~~~~~~ main.cpp:53:55: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 53 | vector<ll> a(n); for (int i = 0; i < n; i++) scanf("%lld", &a[i]), suma += a[i]; | ~~~~~^~~~~~~~~~~~~~~ main.cpp:54:55: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 54 | vector<ll> b(n); for (int i = 0; i < n; i++) scanf("%lld", &b[i]), sumb += b[i]; | ~~~~~^~~~~~~~~~~~~~~
ソースコード
#include <cstdio> #include <iostream> #include <string> #include <sstream> #include <stack> #include <algorithm> #include <cmath> #include <queue> #include <map> #include <set> #include <cstdlib> #include <bitset> #include <tuple> #include <assert.h> #include <deque> #include <bitset> #include <iomanip> #include <limits> #include <chrono> #include <random> #include <array> #include <unordered_map> #include <functional> #include <complex> #include <numeric> template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } //constexpr long long MAX = 5100000; constexpr long long INF = 1LL << 60; constexpr int inf = 1000000007; //constexpr long long mod = 1000000007LL; constexpr long long mod = 998244353LL; const long double PI = acos((long double)(-1)); using namespace std; typedef unsigned long long ull; typedef long long ll; typedef long double ld; void fail() { puts("-1"); exit(0); } int main() { /* cin.tie(nullptr); ios::sync_with_stdio(false); */ int n; scanf("%d", &n); ll suma = 0, sumb = 0; vector<ll> a(n); for (int i = 0; i < n; i++) scanf("%lld", &a[i]), suma += a[i]; vector<ll> b(n); for (int i = 0; i < n; i++) scanf("%lld", &b[i]), sumb += b[i]; if (suma < sumb) fail(); if (n == 2) { if (suma != sumb) fail(); printf("%lld\n", llabs(a[0] - b[0])); return 0; } ll sa = suma - sumb; if (sa % (n - 2) != 0) fail(); ll cnt = sa / (n - 2); ll res = cnt; for (int i = 0; i < n; i++) { a[i] -= cnt; } for (int i = 0; i < n; i++) { if (a[i] > b[i]) fail(); if ((b[i] - a[i]) % 2 == 1) fail(); ll t = (b[i] - a[i]) / 2; if (cnt < t) fail(); cnt -= t; } cout << res << endl; return 0; }