Submission #38592

#	Time	Username	Problem	Language	Result	Execution time	Memory
38592		funcsr	Robots (IOI13_robots)	C++14	0 / 100	0 ms	6312 KiB

robots

#include "robots.h"
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#include <cassert>
#include <algorithm>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define pb push_back
#define _1 first
#define _2 second
#define INF 1145141919
#define MOD 1000000007

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
  int max_x = -1, max_y = -1;
  rep(i, A) X[i]--;
  rep(i, B) Y[i]--;
  rep(i, A) max_x = max(max_x, X[i]);
  rep(i, B) max_y = max(max_y, Y[i]);
  rep(i, T) if (W[i] > max_x && S[i] > max_y) return -1;
  if (T == 2) {
    bool a[2][2] = {};
    rep(i, T) {
      int o = 0;
      rep(j, A) {
        if (W[i] <= X[j]) a[i][o] = true;
        o++;
      }
      rep(j, B) {
        if (S[i] <= Y[j]) a[i][o] = true;
        o++;
      }
    }
    if (a[0][0] || a[1][1]) return 1;
    if (a[0][1] || a[1][0]) return 1;
    return 2;
  }
  abort();
}

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