Submission #403918

#TimeUsernameProblemLanguageResultExecution timeMemory
403918rocks03Rectangles (IOI19_rect)C++14
0 / 100
5100 ms28284 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long #define pii pair<int, int> #define pll pair<ll, ll> #define ff first #define ss second #define pb push_back #define SZ(x) ((int)(x).size()) #define all(x) x.begin(), x.end() #define debug(x) cout << #x << ": " << x << " " #define nl cout << "\n" #define rep(i, a, b) for(int i = (a); i < (b); i++) #define per(i, a, b) for(int i = (a); i >= (b); i--) mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); long long count_rectangles(vector<vector<int>> a){ int N = SZ(a); auto check = [&](int i1, int j1, int i2, int j2){ rep(i, i1, i2 + 1){ int mn = min(a[i][j1 - 1], a[i][j2 + 1]); int mx = -1; rep(j, j1, j2 + 1){ mx = max(mx, a[i][j]); } if(!(mx < mn)) return false; } rep(j, j1, j2 + 1){ int mn = min(a[i1 - 1][j], a[i2 + 1][j]); int mx = -1; rep(i, i1, i2 + 1){ mx = max(mx, a[i][j]); } if(!(mx < mn)) return false; } return true; }; ll ans = 0; rep(i, 1, N - 1){ rep(j, 1, N - 1){ rep(i2, i, N - 1){ rep(j2, j, N - 1){ ans += check(i, j, i2, j2); } } } } return ans; }
#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...