제출 #316634

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
316634		VROOM_VARUN	로봇 (IOI13_robots)	C++14	100 / 100	2035 ms	24484 KiB

robots

/*
ID: varunra2
LANG: C++
TASK: robots
*/

#include <bits/stdc++.h>
#include "robots.h"
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

const int mx = (int)(1e6);

VI x, y;
VII vals;
int n, m, t;

bool works(ll time) {
  if (time >= sz(vals)) return true;
  priority_queue<int> pq;
  int p1 = 0;
  for (int i = 0; i <= n; i++) {
    for (; p1 < t and vals[p1].x < x[i]; p1++) {
      pq.push(vals[p1].y);
    }
    if (i < n) {
      for (int j = 0; j < time and !pq.empty(); j++) {
        pq.pop();
      }
    }
  }

  for (int i = m - 1; i >= 0 and !pq.empty() and pq.top() < y[i]; i--) {
    for (int j = 0; j < time and !pq.empty(); j++) pq.pop();
  }

  return pq.empty();
}

int putaway(int a, int b, int T, int X[], int Y[], int W[], int S[]) {
  n = a;
  m = b;
  t = T;
  x.resize(n);
  y.resize(m);
  vals.resize(t);
  for (int i = 0; i < n; i++) {
    x[i] = X[i];
  }
  for (int i = 0; i < m; i++) {
    y[i] = Y[i];
  }
  for (int i = 0; i < t; i++) {
    vals[i] = MP(W[i], S[i]);
  }
  sort(all(vals));
  sort(all(x));
  sort(all(y));
  int mxx = 0;
  int mxy = 0;
  if (sz(x)) mxx = x.back();
  if (sz(y)) mxy = y.back();
  for (int i = 0; i < t; i++) {
    if (vals[i].x >= mxx and vals[i].y >= mxy) return -1;
  }
  x.PB(2 * INF + 1);
  ll xx = -1;
  for (ll bb = mx; bb >= 1; bb /= 2) {
    while (!works(xx + bb)) xx += bb;
  }
  return xx + 1;
}

// int main() {
// #ifndef ONLINE_JUDGE
//   freopen("robots.in", "r", stdin);
//   freopen("robots.out", "w", stdout);
// #endif
//   cin.sync_with_stdio(0);
//   cin.tie(0);

//   int a, b, T;

//   cin >> a >> b >> T;

//   int X[a], Y[b], W[T], S[T];

//   rep(i, 0, a) cin >> X[i];
//   rep(i, 0, a) cin >> Y[i];
//   rep(i, 0, T) cin >> W[i] >> S[i];

//   cout << putaway(a, b, T, X, Y, W, S) << '\n';

//   return 0;
// }

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 25 / 25
• Subtask 4: 37 / 37
• Subtask 5: 10 / 10