Submission #422568

#	Time	Username	Problem	Language	Result	Execution time	Memory
422568		MeGustaElArroz23	Rectangles (IOI19_rect)	C++14	37 / 100	5029 ms	28288 KiB

rect

#include "rect.h"
#include <cstdio>
#include <unistd.h>
#include <cassert>
#include <string>

#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> vi;
const ll INF=1000000001;

long long count_rectangles(std::vector<std::vector<int> > v) {
	ll sol=0;
	int n=v.size();
	int m=v[0].size();
	for (int i1=1;i1<n-1;i1++){
		for (int i2=i1;i2<n-1;i2++){
			for (int j1=1;j1<m-1;j1++){
				for (int j2=j1;j2<m-1;j2++){
					bool T=true;
					for (int x=i1;x<=i2;x++){
						for (int y=j1;y<=j2;y++){
							if (v[x][y]>=min(min(v[i1-1][y],v[i2+1][y]),min(v[x][j1-1],v[x][j2+1]))){
								T=false;
								break;
							}
						}
						if (T==false) break;
					}
					//int menor=INF;
					//for (int x=i1;x<=i2;x++) menor=min(menor,min(v[x][j1-1],v[x][j2+1]));
					//for (int x=j1;x<=j2;x++) menor=min(menor,min(v[i1-1][x],v[i2+1][x]));
					//if (vi{i1,i2,j1,j2}==vi{1,2,1,1}) cerr << mayor << ' '<<menor<<'\n';
					//if (mayor<menor){
					//	sol++;
						//cerr << i1<<' '<<i2<<' '<<j1<<' '<<j2<<' '<<mayor<<' '<<menor<<'\n';
					//} 
					if (T){
						sol++;
						//cerr<<i1<<' '<<i2<<' '<<j1<<' '<<j2<<'\n';
					}
				}
			}
		}
	}
	return sol;
}

• Subtask 1: 8 / 8
• Subtask 2: 7 / 7
• Subtask 3: 12 / 12
• Subtask 4: 0 / 22
• Subtask 5: 10 / 10
• Subtask 6: 0 / 13
• Subtask 7: 0 / 28