oj.uz

답안 #731054

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
731054 2023-04-26T21:15:17 Z rainboy Cutting a rectangle (LMIO18_staciakampis) C
100 / 100
 33 ms 3088 KB 
#include <stdio.h>
#include <string.h>
 
#define N	100000
 
long long min(long long a, long long b) { return a < b ? a : b; }
 
unsigned int Z = 12345;
 
int rand_() {
	return (Z *= 3) >> 1;
}
 
int aa[N], bb[N], cc[N * 2], ii[N], hh[N * 2], n;
 
int *xx;
 
void sort(int *ii, int l, int r) {
	while (l < r) {
		int i = l, j = l, k = r, i_ = ii[l + rand_() % (r - l)], tmp;
 
		while (j < k)
			if (xx[ii[j]] == xx[i_])
				j++;
			else if (xx[ii[j]] < xx[i_]) {
				tmp = ii[i], ii[i] = ii[j], ii[j] = tmp;
				i++, j++;
			} else {
				k--;
				tmp = ii[j], ii[j] = ii[k], ii[k] = tmp;
			}
		sort(ii, l, i);
		l = k;
	}
}
 
int solve(long long a, long long b) {
	static char used[N];
	int i, iaa, iab, iba, ibb;
 
	memset(used, 0, n * sizeof *used);
	iaa = iab = iba = ibb = n - 1;
	while (a != 0 && b != 0) {
		while (iaa >= 0 && (used[iaa] || aa[iaa] > a))
			iaa--;
		while (iab >= 0 && (used[ii[iab]] || bb[ii[iab]] > a))
			iab--;
		while (iba >= 0 && (used[iba] || aa[iba] > b))
			iba--;
		while (ibb >= 0 && (used[ii[ibb]] || bb[ii[ibb]] > b))
			ibb--;
		if (a > b) {
			if (iaa >= 0 && aa[i = iaa] == a) {
				if (b < bb[i])
					return 0;
				used[i] = 1, b -= bb[i];
			} else if (ibb >= 0 && bb[i = ii[ibb]] == b) {
				if (a < aa[i])
					return 0;
				used[i] = 1, a -= aa[i];
			} else if (iba >= 0 && aa[i = iba] == b) {
				if (a < bb[i])
					return 0;
				used[i] = 1, a -= bb[i];
			} else
				return 0;
		} else {
			if (iba >= 0 && aa[i = iba] == b) {
				if (a < bb[i])
					return 0;
				used[i] = 1, a -= bb[i];
			} else if (iab >= 0 && bb[i = ii[iab]] == a) {
				if (b < aa[i])
					return 0;
				used[i] = 1, b -= aa[i];
			} else if (iaa >= 0 && aa[i = iaa] == a) {
				if (b < bb[i])
					return 0;
				used[i] = 1, b -= bb[i];
			} else
				return 0;
		}
	}
	return 1;
}
 
int main() {
	int m, m_, h, i;
	long long area;
 
	scanf("%d", &n);
	area = 0;
	for (i = 0; i < n; i++) {
		scanf("%d%d", &aa[i], &bb[i]);
		area += (long long) aa[i] * bb[i];
	}
	for (i = 0; i < n; i++)
		ii[i] = i;
	xx = bb, sort(ii, 0, n);
	m = 0;
	for (i = 0; i < n; i++)
		if (area % aa[i] == 0 && solve(aa[i], area / aa[i]))
			cc[m++] = min(aa[i], area / aa[i]);
	for (h = 0; h < n; h++) {
		i = ii[h];
		if ((h == 0 || bb[i] != bb[ii[h - 1]]) && area % bb[i] == 0 && solve(bb[i], area / bb[i]))
			cc[m++] = min(bb[i], area / bb[i]);
	}
	for (h = 0; h < m; h++)
		hh[h] = h;
	xx = cc, sort(hh, 0, m);
	m_ = 0;
	for (h = 0; h < m; h++)
		if (m_ == 0 || cc[hh[m_ - 1]] != cc[hh[h]])
			hh[m_++] = hh[h];
	m = m_;
	printf("%d\n", m);
	for (h = 0; h < m; h++)
		printf("%d\n", cc[hh[h]]);
	return 0;
}

Compilation message

staciakampis.c: In function 'main':
staciakampis.c:91:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   91 |  scanf("%d", &n);
      |  ^~~~~~~~~~~~~~~
staciakampis.c:94:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |   scanf("%d%d", &aa[i], &bb[i]);
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 27 ms 2320 KB Output is correct
5 Correct 31 ms 2312 KB Output is correct
6 Correct 33 ms 2348 KB Output is correct
7 Correct 33 ms 2380 KB Output is correct

Subtask #3
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 27 ms 2320 KB Output is correct
12 Correct 31 ms 2312 KB Output is correct
13 Correct 33 ms 2348 KB Output is correct
14 Correct 33 ms 2380 KB Output is correct
15 Correct 23 ms 2548 KB Output is correct
16 Correct 27 ms 2468 KB Output is correct
17 Correct 25 ms 2428 KB Output is correct
18 Correct 5 ms 724 KB Output is correct
19 Correct 23 ms 2332 KB Output is correct
20 Correct 29 ms 2600 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 25 ms 3088 KB Output is correct