Submission #427126

#TimeUsernameProblemLanguageResultExecution timeMemory
427126dreezyRectangles (IOI19_rect)C++17
0 / 100
68 ms23072 KiB
#include "rect.h" #include <bits/stdc++.h> using namespace std; #define ll long long /*subtask 5: debug*/ long long count_rectangles(vector<vector<int> > a) { int n = a.size(); int m = a[0].size(); ll ans = 0; for(int i =1; i<n-1 ;i++){ int leftind = 0; for(int j =1 ;j <m-1; j++){ int cnt = 0; // cout << a[i][j]<<", "<<leftind<< ": "<<a[i][leftind]<<endl; bool pos = true; if(a[i-1][j] > a[i][j]) cnt++; else pos = false; if(a[i+1][j] > a[i][j]) cnt++; else pos = false; if(a[i][leftind] > a[i][j]) cnt++; else pos = false; if(a[i][j+1] > a[i][j]) cnt++; if(!pos){ leftind = j; } //cout << pos<<" & "<<cnt<<endl; if(cnt == 4){ for(int ii = leftind+1; ii < j; ii++){ if(a[i][ii] >= a[i][j+1]){ leftind = ii; } } ll curans = 0; for(int ii = leftind +1; ii<=j; ii++){ if(a[i][ii] < a[i][ii - 1]){ curans++; //cout << ii<<":"; } } //cout << "!"<<leftind<<endl; ans+= curans; } } } 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...