oj.uz

Submission #1049383

# Submission time Handle Problem Language Result Execution time Memory
1049383 2024-08-08T17:47:05 Z rainboy Bring Down the Grading Server (CEOI23_gradingserver) C
10 / 100
 106 ms 13648 KB 
#include <stdio.h>

long long min(long long a, long long b) { return a < b ? a : b; }

int c;

int solve(long long x1, long long y1, long long x2, long long y2) {
	long long y;
	int turn;

	if (x1 + y1 * c <= 0)
		return 0;
	if (x2 + y2 * c <= 0)
		return 1;
	if (x1 <= 0) {
		if (x2 > 0)
			return !solve(x2, y2, x1 + c, y1 - 1);
		else {
			y = min(-x1 / c + 1, -x2 / c + 1);
			return solve(x1 + y * c, y1 - y, x2 + y * c, y2 - y);
		}
	}
	if (x1 >= x2 && (x1 >= c || y1 > 0))
		return 1;
	if (x2 >= c)
		return !solve(x2 - x1, y2, x1, y1);
	if (y1 > 0)
		x1 += y1 * (c - x2);
	if (x1 >= c)
		return 1;
	if (y2 > 0)
		x2 += y2 * (c - x1);
	turn = 1;
	while (x1 > 0 && x2 > 0) {
		if (turn == 1)
			x2 -= x1;
		else
			x1 -= x2;
		turn ^= 1;
	}
	return x2 <= 0;
}

int main() {
	int t;

	scanf("%d%d", &c, &t);
	while (t--) {
		long long x1, y1, x2, y2;

		scanf("%lld%lld%lld%lld", &x1, &y2, &x2, &y1), x1 -= y1 * c, x2 -= y2 * c;
		printf(solve(x1, y1, x2, y2) ? "YES\n" : "NO\n");
	}
	return 0;
}

Compilation message

gradingserver.c: In function 'main':
gradingserver.c:47:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |  scanf("%d%d", &c, &t);
      |  ^~~~~~~~~~~~~~~~~~~~~
gradingserver.c:51:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |   scanf("%lld%lld%lld%lld", &x1, &y2, &x2, &y1), x1 -= y1 * c, x2 -= y2 * c;
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 43 ms 3856 KB Output is correct
3 Correct 45 ms 4040 KB Output is correct
4 Incorrect 43 ms 4084 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 43 ms 3856 KB Output is correct
3 Correct 45 ms 4040 KB Output is correct
4 Incorrect 43 ms 4084 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 13648 KB Output is correct
2 Correct 78 ms 12368 KB Output is correct
3 Correct 106 ms 13136 KB Output is correct
4 Correct 0 ms 344 KB Output is correct

Subtask #5
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 43 ms 3856 KB Output is correct
3 Correct 45 ms 4040 KB Output is correct
4 Incorrect 43 ms 4084 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 43 ms 3856 KB Output is correct
3 Correct 45 ms 4040 KB Output is correct
4 Incorrect 43 ms 4084 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 43 ms 3856 KB Output is correct
3 Correct 45 ms 4040 KB Output is correct
4 Incorrect 43 ms 4084 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 43 ms 3856 KB Output is correct
3 Correct 45 ms 4040 KB Output is correct
4 Incorrect 43 ms 4084 KB Output isn't correct
5 Halted 0 ms 0 KB -