제출 #306519

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
306519		cheetose	Rectangles (IOI19_rect)	C++17	0 / 100	1 ms	384 KiB

rect

#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<db> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 998244353;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };

bool chk[2500][2500];
int n,m,mnx,mxx,mny,mxy;
int bfs(int i,int j,vector<Vi> &a){
	mnx=i,mxx=i,mny=j,mxy=j;
	queue<Pi> q;
	chk[i][j]=1;
	q.push(mp(i,j));
	int cnt=0;
	while(!q.empty()){
		auto [x,y]=q.front();
		mnx=min(mnx,x),mxx=max(mxx,x);
		mny=min(mny,y),mxy=max(mxy,y);
		q.pop();
		cnt++;
		fup(i,0,3,1){
			int nx=x+dx[i],ny=y+dy[i];
			if(nx>=0 && nx<n && ny>=0 && ny<m && !chk[nx][ny]){

			}
		}
	}
	return cnt;
}
ll count_rectangles(vector<Vi> a){
	n=a.size(),m=a[0].size();
	ll res=0;
	fup(i,0,n-1,1)fup(j,0,m-1,1){
		if(a[i][j]==0 && !chk[i][j]){
			int c=bfs(i,j,a);
			int r=(mxx-mnx+1)*(mxy-mny+1);
			if(c==r && mnx>0 && mxx<n-1 && mny>0 && mxy<m-1)res++;
		}
	}
	return res;
}/*
int main() {
}*/

컴파일 시 표준 에러 (stderr) 메시지

rect.cpp: In function 'int bfs(int, int, std::vector<std::vector<int> >&)':
rect.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
rect.cpp:58:3: note: in expansion of macro 'fup'
   58 |   fup(i,0,3,1){
      |   ^~~
rect.cpp: In function 'll count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
rect.cpp:70:2: note: in expansion of macro 'fup'
   70 |  fup(i,0,n-1,1)fup(j,0,m-1,1){
      |  ^~~
rect.cpp:10:30: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
rect.cpp:70:16: note: in expansion of macro 'fup'
   70 |  fup(i,0,n-1,1)fup(j,0,m-1,1){
      |                ^~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 22
• Subtask 5: 0 / 10
• Subtask 6: 0 / 13
• Subtask 7: 0 / 28