제출 #362227

#제출 시각아이디문제언어결과실행 시간메모리
362227knightron0Rectangles (IOI19_rect)C++14
10 / 100
8 ms384 KiB
#include <bits/stdc++.h> using namespace std; #define pb push_back #define fr first #define sc second #define clr(a, x) memset(a, x, sizeof(a)) #define dbg(x) cout<<"("<<#x<<"): "<<x<<endl; #define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl; #define all(v) v.begin(), v.end() #define lcm(a, b) (a * b)/__gcd(a, b) #define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl; #define endl '\n' #define lli long long int #define float long double const int MOD = 1e9 + 7; const int MAXN = 1e5 + 5; lli count_rectangles(vector<vector<int>> a) { if(a.size() < 3){ return 0LL; } lli n = a[0].size(); bool poss[n+2]; poss[0] = 0; for(lli i= 1;i<n-1;i++){ poss[i] = 0; if(a[1][i] < a[0][i] && a[1][i] < a[2][i]){ poss[i] = 1; } } lli ans= 0; for(lli i= 0;i<n;i++){ lli mx = 0; lli sum = 0; for(int j=i+2;j<n;j++){ mx = max(mx,(lli)a[1][j-1]); sum += poss[j-1]; lli len = j-i-1; if(sum == len && mx < min((lli)a[1][i], (lli) a[1][j])){ ans++; } } } return ans; } // signed main() { // ios_base::sync_with_stdio(false); // cin.tie(NULL); // #ifdef LOCAL // freopen("input.txt", "r", stdin); // #endif // int n, m; // cin>>n>>m; // vector<vector<int>> vec; // for(int i= 0;i<n;i++){ // vector<int> tmp; // for(int j= 0;j<m;j++){ // int x; // cin>>x; // tmp.pb(x); // } // vec.pb(tmp); // } // cout<<count_rectangles(vec)<<endl; // return 0; // }
#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...