Submission #1021403

#	Time	Username	Problem	Language	Result	Execution time	Memory
1021403		vjudge1	Rectangles (IOI19_rect)	C++17	37 / 100	5082 ms	28436 KiB

rect

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC target("popcnt")
#define endl '\n'
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fo(i,n) for(auto i =0 ; i < n;i++)
#define fore(i,l,r) for(auto i = l; i < r;i++)
#define forex(i,r,l) for(auto i = r; i >= l; i--)
#define ffo(i,n) forex(i,n-1,0)
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define sz(x) (int)x.size()
#define gcd(a,b) __gcd(a,b)
#define vii vector<ii>
#define pq_min(a) priority_queue<a, vector<a>, greater<a>>
#define fls cout.flush()
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using ii = pair<int,int>;
using mii = map<int,int>;
using lld = long double;
void valid(ll in){cout<<((in)?"YES\n":"NO\n");}
ll count_rectangles(vector<vi> a){
    ll ans = 0;
    int n = sz(a), m=(sz(a[0]));
    fore(r1,1,n-1){
        fore(c1,1,m-1){
            fore(r2,r1,n-1){
                fore(c2,c1,m-1){
                    bool cn = 1;
                    fore(i,r1,r2+1){
                        if(cn==0)break;
                        fore(j, c1, c2+1){
                            cn &= (a[i][j]<min({a[r1-1][j],a[i][c1-1], a[i][c2+1], a[r2+1][j]}));
                            if(cn==0)break;
                        }
                    }
                    ans+=cn;
                }
            }
        }
    }
    return ans;
}

Compilation message (stderr)

rect.cpp:4: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("O3")
      | 
rect.cpp:5: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("unroll-loops")
      |

• 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