oj.uz

Submission #120996

# Submission time Handle Problem Language Result Execution time Memory
120996 2019-06-25T22:24:32 Z ioilolcom Seats (IOI18_seats) C++14
5 / 100
 4000 ms 63252 KB 
#include "seats.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> r;
std::vector<int> c;
int mr=1e9;
int mc=1e9;
int mmc,mmr;
set<pair<int,int> > st;
bool check(int l){
	for(int i=mr; i<=mmr; i++) {
		for(int j=mc; j<=mmc; j++) {
			if(!st.count({i,j})) {
				return false;
			}
		}
	}
	return true;
}
int h,w;
void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
	r=R;
	c=C;
	h=H;
	w=W;
}

int swap_seats(int a, int b) {
	mr=1e9; mc=1e9;
	mmc=0; mmr=0;
	st.clear();
	swap(r[a],r[b]);
	swap(c[a],c[b] );
	int cnt=0;
	for(int i=0; i<=h*w-1; i++) {
		mr=min(mr,r[i]);
		mmr=max(mmr,r[i]);
		mc=min(mc,c[i]);
		mmc=max(mmc,c[i]);
		st.insert({r[i],c[i]});
		if(check(i)) {
			cnt++;
		}
	}
	return cnt;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 384 KB Output is correct
2 Correct 22 ms 512 KB Output is correct
3 Correct 86 ms 592 KB Output is correct
4 Correct 200 ms 504 KB Output is correct
5 Correct 237 ms 628 KB Output is correct
6 Correct 88 ms 504 KB Output is correct
7 Correct 93 ms 632 KB Output is correct
8 Correct 103 ms 504 KB Output is correct
9 Correct 273 ms 504 KB Output is correct
10 Correct 83 ms 504 KB Output is correct
11 Correct 84 ms 504 KB Output is correct
12 Correct 159 ms 504 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 384 KB Output is correct
2 Correct 22 ms 512 KB Output is correct
3 Correct 86 ms 592 KB Output is correct
4 Correct 200 ms 504 KB Output is correct
5 Correct 237 ms 628 KB Output is correct
6 Correct 88 ms 504 KB Output is correct
7 Correct 93 ms 632 KB Output is correct
8 Correct 103 ms 504 KB Output is correct
9 Correct 273 ms 504 KB Output is correct
10 Correct 83 ms 504 KB Output is correct
11 Correct 84 ms 504 KB Output is correct
12 Correct 159 ms 504 KB Output is correct
13 Execution timed out 4006 ms 1212 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 6.0

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

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 1404 KB Output is correct
2 Correct 61 ms 2036 KB Output is correct
3 Correct 1569 ms 2244 KB Output is correct
4 Execution timed out 4037 ms 1408 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 384 KB Output is correct
2 Correct 22 ms 512 KB Output is correct
3 Correct 86 ms 592 KB Output is correct
4 Correct 200 ms 504 KB Output is correct
5 Correct 237 ms 628 KB Output is correct
6 Correct 88 ms 504 KB Output is correct
7 Correct 93 ms 632 KB Output is correct
8 Correct 103 ms 504 KB Output is correct
9 Correct 273 ms 504 KB Output is correct
10 Correct 83 ms 504 KB Output is correct
11 Correct 84 ms 504 KB Output is correct
12 Correct 159 ms 504 KB Output is correct
13 Execution timed out 4006 ms 1212 KB Time limit exceeded
14 Halted 0 ms 0 KB -