Submission #156771

#TimeUsernameProblemLanguageResultExecution timeMemory
156771AKaan37Rectangles (IOI19_rect)C++17
10 / 100
64 ms22860 KiB
#include "rect.h"
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//Abdulhamid Han
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <cstdio>
#include <unistd.h>
#include <cassert>
#include <string>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t;
int cev;
string s;
vector<int> v;

long long count_rectangles(std::vector<std::vector<int> > v) {
	cev=0;
	for(int i=1;i<(int)v.size()-1;i++){
		for(int j=1;j<(int)v[i].size()-1;j++){
			int mx=0;
			for(int k=j;k<(int)v[i].size()-1;k++){
				mx=max(mx,v[i][k]);
				if(v[i][k]>=v[i-1][k] || v[i][k]>=v[i+1][k])break;
				if(mx<v[i][j-1] && mx<v[i][k+1])cev++;
			}
		}
	}
	return cev;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...