QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#119729#1156. Robotsvalerikk#90 156ms25988kbC++172.0kb2023-07-05 16:26:442024-07-04 00:18:29

Judging History

你现在查看的是最新测评结果

  • [2024-07-04 00:18:29]
  • 评测
  • 测评结果:90
  • 用时:156ms
  • 内存:25988kb
  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-07-05 16:26:44]
  • 提交

answer

#include "robots.h"
#include <bits/stdc++.h>

using namespace std;

namespace {

const int T = 1e6 + 7;
const int A = 5e4 + 7;

int a, b, t;
int x[A], y[A];
int w[T], s[T];
vector<int> xs, ys;
int nx, ny;
vector<int> byw[A];
int c[A];
int fx[A], fy[A];

bool check(int k) {
	for (int i = 0; i <= ny; ++i) {
		c[i] = 0;
	}
	for (int wp = nx; wp >= 0; --wp) {
		for (int i : byw[wp]) {
			for (int j = 0; j <= s[i]; ++j) {
				++c[j];
			}
		}
		for (int sp = 0; sp <= ny; ++sp) {
			if (c[sp] > k * 1ll * (fx[wp] + fy[sp])) {
				return 0;
			}
		}
	}
	return 1;
}

}

int putaway(int grda, int grdb, int grdt, int grdx[], int grdy[], int grdw[], int grds[]) {
	a = grda;
	b = grdb;
	t = grdt;
	for (int i = 0; i < a; ++i) {
		x[i] = grdx[i];
	}
	for (int i = 0; i < b; ++i) {
		y[i] = grdy[i];
	}
	for (int i = 0; i < t; ++i) {
		w[i] = grdw[i];
		s[i] = grds[i];
	}
	for (int i = 0; i < a; ++i) {
		xs.push_back(x[i]);
	}
	for (int i = 0; i < b; ++i) {
		ys.push_back(y[i]);
	}
	sort(xs.begin(), xs.end());
	xs.resize(unique(xs.begin(), xs.end()) - xs.begin());
	sort(ys.begin(), ys.end());
	ys.resize(unique(ys.begin(), ys.end()) - ys.begin());
	nx = xs.size();
	ny = ys.size();
	for (int i = 0; i < a; ++i) {
		x[i] = lower_bound(xs.begin(), xs.end(), x[i]) - xs.begin();
	}
	for (int i = 0; i < b; ++i) {
		y[i] = lower_bound(ys.begin(), ys.end(), y[i]) - ys.begin();
	}
	for (int i = 0; i < t; ++i) {
		w[i] = upper_bound(xs.begin(), xs.end(), w[i]) - xs.begin();
		s[i] = upper_bound(ys.begin(), ys.end(), s[i]) - ys.begin();
		if (w[i] == nx && s[i] == ny) {
			return -1;
		}
	}
	for (int i = 0; i < t; ++i) {
		byw[w[i]].push_back(i);
	}
	for (int i = 0; i < a; ++i) {
		++fx[x[i]];
	}
	for (int i = 0; i < b; ++i) {
		++fy[y[i]];
	}
	for (int i = nx - 1; i >= 0; --i) {
		fx[i] += fx[i + 1];
	}
	for (int i = ny - 1; i >= 0; --i) {
		fy[i] += fy[i + 1];
	}
	int l = 0, r = t;
	while (r - l > 1) {
		int mid = (l + r) / 2;
		if (check(mid)) {
			r = mid;
		} else {
			l = mid;
		}
	}
	return r;
}

详细

Subtask #1:

score: 14
Accepted

Test #1:

score: 14
Accepted
time: 0ms
memory: 14112kb

input:

1 1 2
13
13
5 6
13 13

output:

-1

result:

ok single line: '-1'

Test #2:

score: 0
Accepted
time: 2ms
memory: 12084kb

input:

0 2 2

20 10
7 10
13 10

output:

2

result:

ok single line: '2'

Test #3:

score: 0
Accepted
time: 1ms
memory: 9944kb

input:

2 0 2
10 20

10 7
10 13

output:

2

result:

ok single line: '2'

Test #4:

score: 0
Accepted
time: 1ms
memory: 12000kb

input:

1 1 2
13
13
15 6
5 16

output:

1

result:

ok single line: '1'

Test #5:

score: 0
Accepted
time: 0ms
memory: 14104kb

input:

0 2 2

15 15
7 8
5 6

output:

1

result:

ok single line: '1'

Test #6:

score: 0
Accepted
time: 0ms
memory: 12144kb

input:

2 0 2
15 15

7 8
5 6

output:

1

result:

ok single line: '1'

Test #7:

score: 0
Accepted
time: 1ms
memory: 12148kb

input:

2 0 2
20 1

10 10
10 10

output:

2

result:

ok single line: '2'

Subtask #2:

score: 14
Accepted

Test #8:

score: 14
Accepted
time: 130ms
memory: 25084kb

input:

50000 0 500000
1957680000 64280000 235160000 1384760000 1279320000 1005400000 1481760000 1129920000 1774640000 494160000 763120000 419640000 1742880000 1083000000 278360000 64040000 576880000 1479760000 1872320000 158480000 1183880000 81320000 249920000 30920000 1909240000 870920000 842280000 445640...

output:

17

result:

ok single line: '17'

Test #9:

score: 0
Accepted
time: 76ms
memory: 21656kb

input:

50000 0 500000
1259308694 1722606921 1479714896 1475931297 1942320254 1106961993 1138541861 1203363162 1463675587 1275336085 1847766630 1321488338 1222281203 1591977596 1409525422 1599394067 1145145532 1323526439 1598712171 1714056360 1476058962 1328447976 1935622082 1438076232 1341274687 1862703150...

output:

-1

result:

ok single line: '-1'

Test #10:

score: 0
Accepted
time: 29ms
memory: 18044kb

input:

50000 0 50000
113928 75954 27813 115923 126882 62226 23610 50853 75387 41997 41316 45291 109398 32691 53328 120774 113403 75204 143499 136305 2766 4464 134799 7683 14460 87384 12351 103104 59130 17037 129444 97344 145227 146124 27390 123153 66891 70968 61710 51729 103593 9702 107829 22188 118152 962...

output:

2

result:

ok single line: '2'

Test #11:

score: 0
Accepted
time: 156ms
memory: 25988kb

input:

50000 0 500000
138858 89022 139041 109101 28452 78147 110283 112965 95913 2007 37164 6264 147498 143694 12576 3606 104232 96870 67764 62778 121602 58416 119397 35865 71124 79884 62370 93516 133611 115716 55941 146244 100728 52704 55095 15102 135777 59718 7869 131775 33159 122232 22851 121371 59238 8...

output:

11

result:

ok single line: '11'

Test #12:

score: 0
Accepted
time: 151ms
memory: 23696kb

input:

50000 0 500000
776960000 773040000 1171760000 1106920000 1732640000 446960000 890920000 1737520000 183680000 728320000 1966120000 942880000 1218000000 694600000 1128640000 1696200000 1193000000 1572880000 532400000 1039840000 1833680000 1441840000 1447480000 553240000 366480000 515920000 1723560000 ...

output:

15

result:

ok single line: '15'

Test #13:

score: 0
Accepted
time: 105ms
memory: 21860kb

input:

50000 0 500000
1387853151 1101982239 1390128723 1447889751 1825875294 1064550393 1343204970 1060204064 1069119716 1342433657 1845505214 1670914465 1462776488 1460089570 1107081731 1950533753 1254549911 1866646965 1625749264 1138872479 1104010740 1231654841 1769368758 1137413788 1611385869 1233773347...

output:

10

result:

ok single line: '10'

Subtask #3:

score: 25
Accepted

Dependency #1:

100%
Accepted

Test #14:

score: 25
Accepted
time: 2ms
memory: 12076kb

input:

3 2 10
6 2 9
4 7
4 6
8 5
2 3
7 9
1 8
5 1
3 3
8 7
7 6
10 5

output:

3

result:

ok single line: '3'

Test #15:

score: 0
Accepted
time: 0ms
memory: 12092kb

input:

2 1 3
2 5
2
3 1
5 3
2 2

output:

-1

result:

ok single line: '-1'

Test #16:

score: 0
Accepted
time: 0ms
memory: 12016kb

input:

25 25 50
18 51 45 57 63 54 30 3 24 21 66 48 6 75 42 72 15 69 39 12 27 9 60 36 33
37 35 13 5 45 43 7 31 11 3 21 1 29 17 15 23 47 41 33 27 9 19 39 49 25
80 662167866
41 854818619
59 750281022
32 713696017
137 1142260087
35 1705242223
65 375567545
107 321944609
68 1918798449
62 1099136337
122 169708110...

output:

-1

result:

ok single line: '-1'

Test #17:

score: 0
Accepted
time: 1ms
memory: 12144kb

input:

49 1 50
63 27 87 54 60 105 147 99 30 45 9 72 48 33 24 51 120 126 36 42 66 141 108 69 78 57 123 3 135 90 93 81 129 111 114 12 75 21 18 132 144 15 102 117 39 138 96 6 84
10
124 15
73 15
67 15
40 15
118 15
112 15
10 15
130 15
28 15
127 15
100 15
16 15
119 5
55 15
121 15
13 15
58 15
139 15
7 15
79 15
64...

output:

2

result:

ok single line: '2'

Test #18:

score: 0
Accepted
time: 0ms
memory: 12068kb

input:

1 49 50
10
81 129 135 78 27 96 42 132 45 144 105 18 93 108 138 102 147 90 87 120 39 3 84 63 6 72 123 54 24 30 117 12 66 114 21 75 126 33 57 36 15 69 9 141 99 51 48 111 60
15 22
15 130
5 80
15 139
15 34
15 127
15 100
15 31
15 1
15 91
15 112
15 73
15 28
15 133
15 106
15 97
15 145
15 61
15 94
15 49
15 ...

output:

2

result:

ok single line: '2'

Test #19:

score: 0
Accepted
time: 0ms
memory: 16084kb

input:

25 25 50
1040000000 560000000 1760000000 1600000000 720000000 240000000 1200000000 1440000000 880000000 320000000 960000000 1120000000 480000000 1920000000 800000000 160000000 400000000 640000000 1680000000 1840000000 1360000000 1520000000 80000000 2000000000 1280000000
1920000000 480000000 10400000...

output:

-1

result:

ok single line: '-1'

Test #20:

score: 0
Accepted
time: 1ms
memory: 12072kb

input:

24 26 50
416666665 1416666661 499999998 1333333328 1083333329 1999999992 1916666659 583333331 999999996 1833333326 166666666 1749999993 249999999 833333330 1666666660 916666663 1583333327 333333332 666666664 749999997 1166666662 83333333 1499999994 1249999995
1307692292 1692307672 1923076900 3076923...

output:

2

result:

ok single line: '2'

Subtask #4:

score: 37
Accepted

Dependency #3:

100%
Accepted

Test #21:

score: 37
Accepted
time: 6ms
memory: 12092kb

input:

500 500 10000
175769951 78234442 1989276125 579229354 1738605419 248650831 1893061510 1407903740 1171874474 1768669963 1239985614 979317232 887530302 529213821 1493976544 567840865 536061097 207463241 290134169 1673628081 1493976544 1823996536 587655611 1673628081 1138738442 675708366 372215090 9304...

output:

11

result:

ok single line: '11'

Test #22:

score: 0
Accepted
time: 0ms
memory: 12152kb

input:

500 500 10000
1999907172 1999907172 1999907172 1999907172 1999907172 1999907172 1999907172 1999907172 1999907172 1999907172 1999907172 1999907172 1999907172 1999907172 1999907172 1999907172 1999907172 1999907172 1999907172 1999907172 1999907172 1999907172 1999907172 1999907172 1999907172 1999907172 ...

output:

10

result:

ok single line: '10'

Test #23:

score: 0
Accepted
time: 1ms
memory: 12064kb

input:

50 50 50
51 7 77 65 57 85 13 83 9 71 87 47 31 89 43 99 61 5 53 95 55 39 45 93 73 81 1 29 15 37 49 3 27 91 35 21 41 67 69 33 25 97 75 79 63 19 17 23 11 59
93 111 108 54 96 114 45 3 129 6 105 69 84 99 81 21 63 123 141 126 27 87 147 36 42 78 117 9 144 72 60 18 138 135 15 30 48 57 75 150 12 51 66 102 13...

output:

2

result:

ok single line: '2'

Test #24:

score: 0
Accepted
time: 16ms
memory: 12088kb

input:

512 488 10000
281250000 562500000 1753906250 1312500000 667968750 1738281250 207031250 195312500 1667968750 550781250 1500000000 1382812500 652343750 300781250 488281250 1613281250 156250000 183593750 1789062500 468750000 1300781250 1792968750 375000000 1882812500 1710937500 1363281250 574218750 132...

output:

10

result:

ok single line: '10'

Subtask #5:

score: 0
Time Limit Exceeded

Dependency #1:

100%
Accepted

Dependency #2:

100%
Accepted

Dependency #3:

100%
Accepted

Dependency #4:

100%
Accepted

Test #25:

score: 0
Time Limit Exceeded

input:

50000 50000 500000
208398181 1845063198 1134825502 1643803709 1532449020 1158775061 362576785 1581659943 284852526 192517779 753233392 1946415461 687321340 1987718881 493150485 93783713 1314250099 1081600197 1559998402 712064123 451419087 170695136 690084865 1494151417 620777633 725519615 473043228 ...

output:


result: