oj.uz

Submission #760861

# Submission time Handle Problem Language Result Execution time Memory
760861 2023-06-18T19:16:44 Z Nonoze Seats (IOI18_seats) C++17
11 / 100
 4000 ms 40760 KB 
#include "seats.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> r;
vector<int> c;
int h, w;

int give_nb() {
	int comp=1;
	int c1=c[0], c2=c[0], r1=r[0], r2=r[0];
	for (int i = 1; i < h*w; ++i)
	{
		c1=min(c1, c[i]);
		c2=max(c2, c[i]);
		r1=min(r1, r[i]);
		r2=max(r2, r[i]);
		if ((c2-c1+1)*(r2-r1+1)==i+1)
		{
			comp++;
		}
	}
	return comp;
}

void give_initial_chart(int H, int W, vector<int> R, vector<int> C) {
	r=R, c=C, h=H, w=W;
}

int swap_seats(int a, int b) {
	swap(c[a], c[b]);
	swap(r[a], r[b]);
	return give_nb();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 440 KB Output is correct
3 Correct 3 ms 436 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 4 ms 468 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 468 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 440 KB Output is correct
3 Correct 3 ms 436 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 4 ms 468 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 119 ms 728 KB Output is correct
14 Correct 120 ms 732 KB Output is correct
15 Correct 124 ms 740 KB Output is correct
16 Correct 121 ms 748 KB Output is correct
17 Correct 120 ms 680 KB Output is correct
18 Correct 120 ms 728 KB Output is correct
19 Correct 120 ms 724 KB Output is correct
20 Correct 134 ms 804 KB Output is correct
21 Correct 121 ms 744 KB Output is correct
22 Correct 119 ms 724 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4054 ms 39712 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 748 KB Output is correct
2 Correct 1077 ms 3668 KB Output is correct
3 Execution timed out 4018 ms 39736 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1956 KB Output is correct
2 Correct 12 ms 2000 KB Output is correct
3 Correct 23 ms 1960 KB Output is correct
4 Correct 131 ms 2028 KB Output is correct
5 Correct 1186 ms 2344 KB Output is correct
6 Execution timed out 4043 ms 40760 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 440 KB Output is correct
3 Correct 3 ms 436 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 4 ms 468 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 119 ms 728 KB Output is correct
14 Correct 120 ms 732 KB Output is correct
15 Correct 124 ms 740 KB Output is correct
16 Correct 121 ms 748 KB Output is correct
17 Correct 120 ms 680 KB Output is correct
18 Correct 120 ms 728 KB Output is correct
19 Correct 120 ms 724 KB Output is correct
20 Correct 134 ms 804 KB Output is correct
21 Correct 121 ms 744 KB Output is correct
22 Correct 119 ms 724 KB Output is correct
23 Execution timed out 4054 ms 39712 KB Time limit exceeded
24 Halted 0 ms 0 KB -