oj.uz

답안 #299087

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
299087 2020-09-14T13:15:40 Z TMJN Rectangles (IOI19_rect) C++17
37 / 100
 5000 ms 326500 KB 
#include <bits/stdc++.h>
#include "rect.h"
using namespace std;

set<int>sth[2500],stw[2500];
set<pair<int,int>>stph[2500],stpw[2500];
vector<pair<int,pair<int,int>>>p;
int H,W,res;



long long count_rectangles(vector<vector<int>>a){
	H=a.size();
	W=a[0].size();
	for(int i=0;i<H;i++){
		for(int j=0;j<W;j++){
			p.push_back({a[i][j],{i,j}});
		}
	}
	p.push_back({0xE869120,{-1,-1}});
	sort(p.begin(),p.end());
	for(int i=0;i<H;i++){
		for(int j=-1;j<=W;j++){
			sth[i].insert(j);
		}
	}
	for(int i=0;i<W;i++){
		for(int j=-1;j<=H;j++){
			stw[i].insert(j);
		}
	}
	for(int i=0;i<p.size()-1;i++){
		if(i&&p[i-1].first==p[i].first)continue;
		for(int j=i;p[i].first==p[j].first;j++){
			sth[p[j].second.first].erase(p[j].second.second);
			stw[p[j].second.second].erase(p[j].second.first);
		}
		vector<pair<pair<int,int>,pair<int,int>>>pp;
		for(int j=i;p[i].first==p[j].first;j++){
			int lx,rx,ly,ry;
			auto it=sth[p[j].second.first].lower_bound(p[j].second.second);
			ry=*it;
			it--;
			ly=*it;
			auto it2=stw[p[j].second.second].lower_bound(p[j].second.first);
			rx=*it2;
			it2--;
			lx=*it2;
			lx++;
			rx--;
			ly++;
			ry--;
			if(lx<=0||ly<=0||H-1<=rx||W-1<=ry)continue;
			stph[p[j].second.first].insert({ly,ry});
			stpw[p[j].second.second].insert({lx,rx});
		}
		for(int j=i;p[i].first==p[j].first;j++){
			int lx,rx,ly,ry;
			auto it=sth[p[j].second.first].lower_bound(p[j].second.second);
			ry=*it;
			it--;
			ly=*it;
			auto it2=stw[p[j].second.second].lower_bound(p[j].second.first);
			rx=*it2;
			it2--;
			lx=*it2;
			lx++;
			rx--;
			ly++;
			ry--;
			if(lx<=0||ly<=0||H-1<=rx||W-1<=ry)continue;
			bool f=true;
			for(int k=lx;k<=rx;k++){
				if(stph[k].find({ly,ry})==stph[k].end()){
					f=false;
					break;
				}
			}
			for(int k=ly;k<=ry;k++){
				if(stpw[k].find({lx,rx})==stpw[k].end()){
					f=false;
					break;
				}
			}
			if(f){
				pp.push_back({{lx,rx},{ly,ry}});
			}
		}
		sort(pp.begin(),pp.end());
		pp.erase(unique(pp.begin(),pp.end()),pp.end());
		res+=pp.size();
	}
	return res;
}

Compilation message

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:32:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |  for(int i=0;i<p.size()-1;i++){
      |              ~^~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 2 ms 896 KB Output is correct
3 Correct 2 ms 896 KB Output is correct
4 Correct 2 ms 896 KB Output is correct
5 Correct 1 ms 896 KB Output is correct
6 Correct 2 ms 896 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 2 ms 896 KB Output is correct
10 Correct 2 ms 896 KB Output is correct
11 Correct 2 ms 896 KB Output is correct
12 Correct 2 ms 896 KB Output is correct
13 Correct 1 ms 768 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 1 ms 768 KB Output is correct
17 Correct 1 ms 768 KB Output is correct
18 Correct 1 ms 768 KB Output is correct
19 Correct 1 ms 896 KB Output is correct
20 Correct 1 ms 896 KB Output is correct
21 Correct 1 ms 768 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 2 ms 896 KB Output is correct
3 Correct 2 ms 896 KB Output is correct
4 Correct 2 ms 896 KB Output is correct
5 Correct 1 ms 896 KB Output is correct
6 Correct 2 ms 896 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 2 ms 896 KB Output is correct
10 Correct 2 ms 896 KB Output is correct
11 Correct 2 ms 896 KB Output is correct
12 Correct 2 ms 896 KB Output is correct
13 Correct 1 ms 768 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 1 ms 768 KB Output is correct
17 Correct 16 ms 1536 KB Output is correct
18 Correct 16 ms 1536 KB Output is correct
19 Correct 16 ms 1536 KB Output is correct
20 Correct 7 ms 1536 KB Output is correct
21 Correct 10 ms 1536 KB Output is correct
22 Correct 9 ms 1536 KB Output is correct
23 Correct 10 ms 1536 KB Output is correct
24 Correct 5 ms 1280 KB Output is correct
25 Correct 1 ms 768 KB Output is correct
26 Correct 1 ms 768 KB Output is correct
27 Correct 1 ms 896 KB Output is correct
28 Correct 1 ms 896 KB Output is correct
29 Correct 1 ms 768 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 2 ms 896 KB Output is correct
3 Correct 2 ms 896 KB Output is correct
4 Correct 2 ms 896 KB Output is correct
5 Correct 1 ms 896 KB Output is correct
6 Correct 2 ms 896 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 2 ms 896 KB Output is correct
10 Correct 2 ms 896 KB Output is correct
11 Correct 2 ms 896 KB Output is correct
12 Correct 2 ms 896 KB Output is correct
13 Correct 1 ms 768 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 1 ms 768 KB Output is correct
17 Correct 16 ms 1536 KB Output is correct
18 Correct 16 ms 1536 KB Output is correct
19 Correct 16 ms 1536 KB Output is correct
20 Correct 7 ms 1536 KB Output is correct
21 Correct 10 ms 1536 KB Output is correct
22 Correct 9 ms 1536 KB Output is correct
23 Correct 10 ms 1536 KB Output is correct
24 Correct 5 ms 1280 KB Output is correct
25 Correct 216 ms 5872 KB Output is correct
26 Correct 199 ms 5624 KB Output is correct
27 Correct 209 ms 5744 KB Output is correct
28 Correct 50 ms 5616 KB Output is correct
29 Correct 98 ms 5496 KB Output is correct
30 Correct 86 ms 5740 KB Output is correct
31 Correct 97 ms 5624 KB Output is correct
32 Correct 87 ms 5624 KB Output is correct
33 Correct 1 ms 768 KB Output is correct
34 Correct 1 ms 768 KB Output is correct
35 Correct 1 ms 896 KB Output is correct
36 Correct 1 ms 896 KB Output is correct
37 Correct 1 ms 768 KB Output is correct

Subtask #4
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 2 ms 896 KB Output is correct
3 Correct 2 ms 896 KB Output is correct
4 Correct 2 ms 896 KB Output is correct
5 Correct 1 ms 896 KB Output is correct
6 Correct 2 ms 896 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 2 ms 896 KB Output is correct
10 Correct 2 ms 896 KB Output is correct
11 Correct 2 ms 896 KB Output is correct
12 Correct 2 ms 896 KB Output is correct
13 Correct 1 ms 768 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 1 ms 768 KB Output is correct
17 Correct 16 ms 1536 KB Output is correct
18 Correct 16 ms 1536 KB Output is correct
19 Correct 16 ms 1536 KB Output is correct
20 Correct 7 ms 1536 KB Output is correct
21 Correct 10 ms 1536 KB Output is correct
22 Correct 9 ms 1536 KB Output is correct
23 Correct 10 ms 1536 KB Output is correct
24 Correct 5 ms 1280 KB Output is correct
25 Correct 216 ms 5872 KB Output is correct
26 Correct 199 ms 5624 KB Output is correct
27 Correct 209 ms 5744 KB Output is correct
28 Correct 50 ms 5616 KB Output is correct
29 Correct 98 ms 5496 KB Output is correct
30 Correct 86 ms 5740 KB Output is correct
31 Correct 97 ms 5624 KB Output is correct
32 Correct 87 ms 5624 KB Output is correct
33 Correct 487 ms 59856 KB Output is correct
34 Correct 416 ms 59864 KB Output is correct
35 Correct 424 ms 59868 KB Output is correct
36 Correct 473 ms 59736 KB Output is correct
37 Execution timed out 5033 ms 59800 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 1920 KB Output is correct
2 Correct 16 ms 1664 KB Output is correct
3 Correct 4 ms 1920 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 8 ms 1920 KB Output is correct
6 Correct 9 ms 1920 KB Output is correct
7 Correct 8 ms 1920 KB Output is correct
8 Correct 8 ms 1960 KB Output is correct
9 Correct 8 ms 1920 KB Output is correct
10 Correct 3 ms 1280 KB Output is correct
11 Correct 5 ms 1664 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB Output is correct
2 Execution timed out 5035 ms 326500 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 2 ms 896 KB Output is correct
3 Correct 2 ms 896 KB Output is correct
4 Correct 2 ms 896 KB Output is correct
5 Correct 1 ms 896 KB Output is correct
6 Correct 2 ms 896 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 2 ms 896 KB Output is correct
10 Correct 2 ms 896 KB Output is correct
11 Correct 2 ms 896 KB Output is correct
12 Correct 2 ms 896 KB Output is correct
13 Correct 1 ms 768 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 1 ms 768 KB Output is correct
17 Correct 16 ms 1536 KB Output is correct
18 Correct 16 ms 1536 KB Output is correct
19 Correct 16 ms 1536 KB Output is correct
20 Correct 7 ms 1536 KB Output is correct
21 Correct 10 ms 1536 KB Output is correct
22 Correct 9 ms 1536 KB Output is correct
23 Correct 10 ms 1536 KB Output is correct
24 Correct 5 ms 1280 KB Output is correct
25 Correct 216 ms 5872 KB Output is correct
26 Correct 199 ms 5624 KB Output is correct
27 Correct 209 ms 5744 KB Output is correct
28 Correct 50 ms 5616 KB Output is correct
29 Correct 98 ms 5496 KB Output is correct
30 Correct 86 ms 5740 KB Output is correct
31 Correct 97 ms 5624 KB Output is correct
32 Correct 87 ms 5624 KB Output is correct
33 Correct 487 ms 59856 KB Output is correct
34 Correct 416 ms 59864 KB Output is correct
35 Correct 424 ms 59868 KB Output is correct
36 Correct 473 ms 59736 KB Output is correct
37 Execution timed out 5033 ms 59800 KB Time limit exceeded
38 Halted 0 ms 0 KB -