제출 #65334

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
65334		boook	로봇 (IOI13_robots)	C++14	76 / 100	228 ms	31800 KiB

robots

#include "robots.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define REP(i,j,k)     for(int i = j ; i < k ; ++i)
#define RREP(i,j,k)    for(int i = j ; i >=k ; --i)
#define A    first
#define B    second
#define mp   make_pair
#define pb   emplace_back
#define PII pair<int , int>
#define MEM(i,j)   memset(i , j , sizeof i)
#define ALL(i)     i.begin() , i.end()
#define DBGG(i,j)     cout << i << " " << j << endl
#define DB4(i,j,k,l)  cout << i << " " << j << " " << k << " " << l << endl
#define IOS cin.tie(0) , cout.sync_with_stdio(0)
#define endl "\n"
///------------------------------------------------------------
#define MAX 1010
#define INF 0x3f3f3f3f

int sum[MAX][MAX];
int putaway(int a, int b, int n, int x[], int y[], int w[], int s[]) {
	sort(x , x + a) , a[x] = 2123456789;
	sort(y , y + b) , b[y] = 2123456789;
	REP(i , 0 , n){
		if(x[a - 1] <= w[i] && y[b - 1] <= s[i]) return -1;
		else {
			int v1 = upper_bound(x , x + a + 1 , w[i]) - x;
			int v2 = upper_bound(y , y + b + 1 , s[i]) - y;
			sum[a - v1][b - v2] ++;
		}
	}
	// REP(i , 1 , a + 2){
	// 	REP(j , 1 , b + 2) cout << sum[i][j] << " "; cout << endl;
	// }
	// cout << "----------" << endl;
	// REP(i , 1 , a + 2){
	// 	REP(j , 1 , b + 2) cout << (i + j) * 2 << " "; cout << endl;
	// }
	// REP(i , 1 , a + 2) REP(j , 1 , b + 2) sum[i][j] += sum[i - 1][j];
	// REP(i , 1 , a + 2) REP(j , 1 , b + 2) sum[i][j] += sum[i][j - 1];
	REP(i , 0 , a + 1) REP(j , 0 , b + 1){
		if(i - 1 >= 0) sum[i][j] += sum[i - 1][j];
		if(j - 1 >= 0) sum[i][j] += sum[i][j - 1];
		if(i - 1 >= 0 && j - 1 >= 0) sum[i][j] -= sum[i - 1][j - 1];
	}
	int ans = n;
	RREP(base , 20 , 0){
		int to = ans - (1 << base);
		if(to >= 1){
			int ok = 1;
			REP(i , 0 , a + 1) REP(j , 0 , b + 1){
				if((i + j) * to < sum[i][j]){
					ok = 0;
					break;
				}
			}
			if(ok == 1) ans = to;
		}
	}
    return ans;
}

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