結果

問題 No.817 Coin donation
ユーザー knshnb
提出日時 2019-04-19 21:44:17
言語 C++14
(gcc 8.2.0)
結果
AC  
実行時間 48 ms
コード長 2,642 Byte
コンパイル時間 1,447 ms
使用メモリ 4,460 KB
最終ジャッジ日時 2019-07-06 02:52:17

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
1_sample1.txt AC 2 ms
1,536 KB
1_sample2.txt AC 3 ms
1,536 KB
2_small1.txt AC 3 ms
1,544 KB
2_small2.txt AC 3 ms
1,552 KB
2_small3.txt AC 3 ms
1,544 KB
3_large1.txt AC 3 ms
1,632 KB
3_large2.txt AC 9 ms
1,820 KB
3_large3.txt AC 11 ms
1,816 KB
3_large4.txt AC 34 ms
3,404 KB
3_large5.txt AC 13 ms
2,084 KB
4_max1.txt AC 47 ms
4,456 KB
4_max2.txt AC 47 ms
4,460 KB
4_max3.txt AC 48 ms
4,460 KB
5_corner1.txt AC 3 ms
1,536 KB
5_corner2.txt AC 3 ms
1,532 KB
5_corner3.txt AC 3 ms
1,536 KB
テストケース一括ダウンロード

ソースコード

diff #
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) begin(obj), end(obj)
#define RALL(obj) rbegin(obj), rend(obj)
#define fi first
#define se second
using ii = pair<int, int>;
vector<ii> dirs = {
  {1, 0}, {0, 1}, {-1, 0}, {0, -1},  // 4方向
  {1, 1}, {-1, 1}, {-1, -1}, {1, -1},  // 斜め
  {0, 0},  // 自身
};
template <class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }
template <class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <class T, class S> vector<T> make_vec(size_t n, S x) { return vector<T>(n, x); }
template <class T, class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec<T>(ts...))>(n, make_vec<T>(ts...)); }

// debug
template <class T> ostream& operator<<(ostream& s, vector<T>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : " "); return s; }
template <class T> ostream& operator<<(ostream& s, vector<vector<T>>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : "\n"); return s; }
template <class T, class S> ostream& operator<<(ostream& s, pair<T, S>& p) { s << "{" << p.first << ", " << p.second << "}"; return s; }
template <class T, class S> ostream& operator<<(ostream& s, map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
#ifdef _MY_DEBUG
  #define dump(...) cerr << "/* " << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << endl, dump_func(__VA_ARGS__), cerr << "*/\n\n";
#else
  #define dump(...)
  #define endl "\n"
#endif
void dump_func() { cerr << endl; }
template <class Head, class... Tail> void dump_func(Head&& h, Tail&&... t) { cerr << h << (sizeof...(Tail) == 0 ? "" : ", "), dump_func(forward<Tail>(t)...); }

struct Fast { Fast() { cin.tie(0); ios::sync_with_stdio(false); } } fast;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
constexpr int MOD = 1000000007;
// *************** TEMPLATE END *************** 

signed main() {
  int n, k; cin >> n >> k;
  vector<ii> ps(2 * n);
  REP (i, n) {
    int a, b; cin >> a >> b;
    ps[2 * i] = {a, 1};
    ps[2 * i + 1] = {b + 1, -1};
  }
  sort(ALL(ps));
  int acc = 0, now = 0;
  int bef = -1;
  for (auto p: ps) {
    if (acc + (p.fi - bef) * now >= k) {
      cout << bef + (k - acc + now - 1) / now - 1 << endl; return 0;
    }
    acc += (p.fi - bef) * now;
    now += p.se;
    bef = p.fi;
  }
}
0