oj.uz

Submission #768791

# Submission time Handle Problem Language Result Execution time Memory
768791 2023-06-28T15:41:25 Z Baytoro Seats (IOI18_seats) C++17
11 / 100
 4000 ms 26524 KB 
#include "seats.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
#define fr first
#define sc second
using namespace std;
const int N=1e6+5;
pair<int,int> A[N];
int h,w;
void give_initial_chart(int H, int W, vector<int> R, vector<int> C) {
	h=H,w=W;
	for(int i=0;i<H*W;i++)
		A[i]={R[i],C[i]};
}

int swap_seats(int a, int b) {
	swap(A[a],A[b]);
	int ans=1;
	int l=A[0].fr,r=A[0].fr;
	int u=A[0].sc,d=A[0].sc;
	for(int i=1;i<h*w;i++){
		l=min(l,A[i].fr);
		r=max(r,A[i].fr);
		d=min(d,A[i].sc);
		u=max(u,A[i].sc);
		if(i+1==(r-l+1)*(u-d+1)) ans++;
	}
	return ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 468 KB Output is correct
2 Correct 2 ms 448 KB Output is correct
3 Correct 3 ms 404 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 3 ms 468 KB Output is correct
6 Correct 3 ms 444 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 448 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 404 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 3 ms 468 KB Output is correct
2 Correct 2 ms 448 KB Output is correct
3 Correct 3 ms 404 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 3 ms 468 KB Output is correct
6 Correct 3 ms 444 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 448 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 404 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 120 ms 732 KB Output is correct
14 Correct 119 ms 752 KB Output is correct
15 Correct 119 ms 736 KB Output is correct
16 Correct 119 ms 744 KB Output is correct
17 Correct 121 ms 736 KB Output is correct
18 Correct 119 ms 740 KB Output is correct
19 Correct 119 ms 724 KB Output is correct
20 Correct 120 ms 736 KB Output is correct
21 Correct 133 ms 724 KB Output is correct
22 Correct 125 ms 732 KB Output is correct

Subtask #3
0 / 20.0

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

Subtask #4
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 744 KB Output is correct
2 Correct 1073 ms 3252 KB Output is correct
3 Execution timed out 4057 ms 25944 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1968 KB Output is correct
2 Correct 12 ms 1988 KB Output is correct
3 Correct 23 ms 2004 KB Output is correct
4 Correct 129 ms 2020 KB Output is correct
5 Correct 1186 ms 2208 KB Output is correct
6 Execution timed out 4027 ms 26524 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 468 KB Output is correct
2 Correct 2 ms 448 KB Output is correct
3 Correct 3 ms 404 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 3 ms 468 KB Output is correct
6 Correct 3 ms 444 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 448 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 404 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 120 ms 732 KB Output is correct
14 Correct 119 ms 752 KB Output is correct
15 Correct 119 ms 736 KB Output is correct
16 Correct 119 ms 744 KB Output is correct
17 Correct 121 ms 736 KB Output is correct
18 Correct 119 ms 740 KB Output is correct
19 Correct 119 ms 724 KB Output is correct
20 Correct 120 ms 736 KB Output is correct
21 Correct 133 ms 724 KB Output is correct
22 Correct 125 ms 732 KB Output is correct
23 Execution timed out 4101 ms 26144 KB Time limit exceeded
24 Halted 0 ms 0 KB -