#516447 (C++14) No.1120 Strange Teacher

• 問題: No.1120 Strange Teacher
• ユーザー: chocono2230
• 提出日時: 2020-07-22 22:31:34
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 63 ms / 1,000 ms
• コード長: 1,417 bytes
• コンパイル時間: 1,666 ms
• コンパイル使用メモリ: 169,164 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-06-22 23:09:53
• 合計ジャッジ時間: 3,404 ms
• ジャッジサーバーID （参考情報）: judge5 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,816 KB
testcase_01	AC	2 ms; 6,940 KB
testcase_02	AC	2 ms; 6,940 KB
testcase_03	AC	7 ms; 6,940 KB
testcase_04	AC	55 ms; 6,944 KB
testcase_05	AC	57 ms; 6,940 KB
testcase_06	AC	54 ms; 6,940 KB
testcase_07	AC	55 ms; 6,940 KB
testcase_08	AC	56 ms; 6,940 KB
testcase_09	AC	2 ms; 6,940 KB
testcase_10	AC	58 ms; 6,940 KB
testcase_11	AC	55 ms; 6,940 KB
testcase_12	AC	57 ms; 6,944 KB
testcase_13	AC	57 ms; 6,944 KB
testcase_14	AC	56 ms; 6,940 KB
testcase_15	AC	55 ms; 6,944 KB
testcase_16	AC	56 ms; 6,940 KB
testcase_17	AC	56 ms; 6,944 KB
testcase_18	AC	2 ms; 6,940 KB
testcase_19	AC	63 ms; 6,940 KB
testcase_20	AC	2 ms; 6,944 KB
testcase_21	AC	1 ms; 6,944 KB
testcase_22	AC	1 ms; 6,944 KB
testcase_23	AC	2 ms; 6,940 KB
testcase_24	AC	49 ms; 6,940 KB
testcase_25	AC	2 ms; 6,940 KB
testcase_26	AC	1 ms; 6,940 KB
testcase_27	AC	1 ms; 6,944 KB
testcase_28	AC	2 ms; 6,944 KB
testcase_29	AC	1 ms; 6,944 KB

ソースコード

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;

int main(){
  int n;
  cin >> n;
  vector<int> a(n);
  rep(i, n) cin >> a.at(i);
  vector<int> b(n);
  rep(i, n) cin >> b.at(i);
  ll suma = 0, sumb = 0;
  ll ans = 0, diff = 0;
  rep(i, n){
    if(b.at(i)-a.at(i) > 0) ans += b.at(i)-a.at(i);
    else diff += a.at(i)-b.at(i);
    suma += a.at(i);
    sumb += b.at(i);
  }
  if(n == 2){
    if(suma != sumb){
      cout << -1 << endl;
      return 0;
    }
  }else{
    cerr << suma << " " << sumb << " " << ans << " " << diff << endl;
    if(suma < sumb || (suma - sumb) % (n-2) != 0){
      cout << -1 << endl;
      return 0;
    }
    ans = (suma-sumb)/(n-2);
    ll co = 0;
    rep(i, n){
      a.at(i) -= ans;
      if(b.at(i) < a.at(i) || (b.at(i) - a.at(i)) % 2 != 0){
        cout << -1 << endl;
        return 0;
      }
      co += (b.at(i)-a.at(i))/2;
    }
    if(co != ans){
      cout << -1 << endl;
      return 0;
    }
  }
  cout << ans << endl;
  return 0;
}