oj.uz

Submission #294923

# Submission time Handle Problem Language Result Execution time Memory
294923 2020-09-09T10:48:39 Z mohammad Seats (IOI18_seats) C++14
5 / 100
 4000 ms 97304 KB 
#include "seats.h"
#include<bits/stdc++.h>
using namespace std;
 
#define endl "\n"
// #define int long long

typedef long long ll ;
const ll ooo = 1e14 ;
const ll oo = 2e9 ;
const double PI = acos(-1) ;
const ll M = 1e9 + 7  ;
const int N = 10000010  ;

vector<vector<int>> g;
vector<int> r , c;
map<int, pair<int,int>> mp ;
int n = 0 , m = 0  ;

void give_initial_chart(int H, int W, vector<int> R, vector<int> C) {
	g = vector<vector<int>>(H , vector<int>(W , 0));
	r = R;
	c = C;
	n = H;
	m = W;
	for(int i = 0 ; i < n*m ; ++i) g[R[i]][C[i]] = i , mp[i] = {R[i] , C[i]};
}

int swap_seats(int a, int b) {
	swap(mp[a] , mp[b]);
	int mx = oo , my = oo , mxx = 0 , myy = 0 , ans = 0;
	for(int i = 0 ; i < m * n ; ++i){
		mx = min(mx , mp[i].first);
		my = min(my , mp[i].second);
		mxx = max(mxx , mp[i].first);
		myy = max(myy , mp[i].second);
		// cout << mx << ' ' << my << ' ' << mxx << ' ' << myy << ' ' << (myy - my + 1) * (mxx - mx + 1) << endl;
		if((myy - my + 1) * (mxx - mx + 1) == i + 1){
			ans++;
		}
	}
	return ans ;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 13 ms 512 KB Output is correct
3 Correct 30 ms 504 KB Output is correct
4 Correct 32 ms 504 KB Output is correct
5 Correct 30 ms 512 KB Output is correct
6 Correct 30 ms 504 KB Output is correct
7 Correct 31 ms 504 KB Output is correct
8 Correct 28 ms 512 KB Output is correct
9 Correct 28 ms 480 KB Output is correct
10 Correct 31 ms 556 KB Output is correct
11 Correct 37 ms 504 KB Output is correct
12 Correct 30 ms 512 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 13 ms 512 KB Output is correct
3 Correct 30 ms 504 KB Output is correct
4 Correct 32 ms 504 KB Output is correct
5 Correct 30 ms 512 KB Output is correct
6 Correct 30 ms 504 KB Output is correct
7 Correct 31 ms 504 KB Output is correct
8 Correct 28 ms 512 KB Output is correct
9 Correct 28 ms 480 KB Output is correct
10 Correct 31 ms 556 KB Output is correct
11 Correct 37 ms 504 KB Output is correct
12 Correct 30 ms 512 KB Output is correct
13 Execution timed out 4050 ms 1408 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 4029 ms 97304 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 4091 ms 1408 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 2044 KB Output is correct
2 Correct 35 ms 2036 KB Output is correct
3 Correct 299 ms 2164 KB Output is correct
4 Execution timed out 4029 ms 1980 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 13 ms 512 KB Output is correct
3 Correct 30 ms 504 KB Output is correct
4 Correct 32 ms 504 KB Output is correct
5 Correct 30 ms 512 KB Output is correct
6 Correct 30 ms 504 KB Output is correct
7 Correct 31 ms 504 KB Output is correct
8 Correct 28 ms 512 KB Output is correct
9 Correct 28 ms 480 KB Output is correct
10 Correct 31 ms 556 KB Output is correct
11 Correct 37 ms 504 KB Output is correct
12 Correct 30 ms 512 KB Output is correct
13 Execution timed out 4050 ms 1408 KB Time limit exceeded
14 Halted 0 ms 0 KB -