제출 #427710

#제출 시각아이디문제언어결과실행 시간메모리
427710Ahmadsm2005Rectangles (IOI19_rect)C++14
컴파일 에러
0 ms0 KiB
#include "rect.h" //#include "grader.cpp" #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2") #pragma GCC optimize("-ffast-math") #pragma GCC optimize("-funroll-loops") #pragma GCC optimize("-funroll-all-loops,-fpeel-loops,-funswitch-loops") #include<bits/stdc++.h> using namespace std; vector<vector<pair<int,int>>>RE(2501); int sparseR[2501][2501][12],sparseC[2501][2501][12],n,m,LOG[2501]; vector<vector<int>>A; void BUILD(){ for(int i=0;i<n;i++) for(int l=0;l<m;l++) sparseR[i][l][0]=A[i][l]; for(int i=0;i<n;i++) for(int l=0;l<m;l++) sparseC[l][i][0]=A[i][l]; for(int i=0;i<n;i++){ for(int x=1;x<12;x++){ for(int l=0;l+(1<<(x))<=m;l++){ sparseR[i][l][x]=max(sparseR[i][l][x-1],sparseR[i][l+(1<<(x-1))][x-1]); } } } for(int i=0;i<m;i++){ for(int x=1;x<12;x++){ for(int l=0;l+(1<<(x))<=n;l++){ sparseC[i][l][x]=max(sparseC[i][l][x-1],sparseC[i][l+(1<<(x-1))][x-1]); } } } } int queryRz(int X1,int X2,int Y){ int DIFF=LOG[X2-X1+1]; return max(sparseR[Y][X1][DIFF],sparseR[Y][X2-(1<<DIFF)+1][DIFF]); } int queryCz(int Y1,int Y2,int X){ return max(sparseC[X][Y1][LOG[Y2-Y1+1]],sparseC[X][Y2-(1<<DIFF)+1][LOG[Y2-Y1+1]]); } bool check(int x1,int x2,int y1,int y2){ for(int i=y1;i<=y2;i++){ int F=max(sparseC[i][x1][LOG[x2-x1+1]],sparseC[i][x2-(1<<DIFF)+1][LOG[x2-x1+1]]); if((F>=A[x1-1][i])||(F>=A[x2+1][i])) return 0; } return 1; } bool check2(int x1,int x2,int y1,int y2){ for(int i=x1;i<=x2;i++){ int F=max(sparseR[i][y1][LOG[y2-y1+1]],sparseR[i][y2-(1<<DIFF)+1][LOG[y2-y1+1]]); if((F>=A[i][y1-1])||(F>=A[i][y2+1])) return 0; } return 1; } long long count_rectangles(vector<vector<int>>a){ LOG[1]=0; for(int i=2;i<=2500;i++) LOG[i]=LOG[i/2]+1; A=a; n=a.size(),m=a[0].size(); BUILD(); for(int i=1;i<n-1;i++){ for(int l=1;l<m-1;l++){ for(int x=l;x<m-1;x++){ if(check2(i,i,l,x)){ RE[i].push_back({l,x}); } } } } int CNT=0; for(int i=1;i<n-1;i++){ for(int x=0;x<RE[i].size();x++){ for(int l=i;l<n-1;l++){ if(!check2(l,l,RE[i][x].first,RE[i][x].second)) break; if(check(i,l,RE[i][x].first,RE[i][x].second)){ CNT++; } } } } return CNT; }

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

rect.cpp: In function 'int queryCz(int, int, int)':
rect.cpp:40:59: error: 'DIFF' was not declared in this scope
   40 | return max(sparseC[X][Y1][LOG[Y2-Y1+1]],sparseC[X][Y2-(1<<DIFF)+1][LOG[Y2-Y1+1]]);
      |                                                           ^~~~
rect.cpp: In function 'bool check(int, int, int, int)':
rect.cpp:44:58: error: 'DIFF' was not declared in this scope
   44 | int F=max(sparseC[i][x1][LOG[x2-x1+1]],sparseC[i][x2-(1<<DIFF)+1][LOG[x2-x1+1]]);
      |                                                          ^~~~
rect.cpp: In function 'bool check2(int, int, int, int)':
rect.cpp:52:58: error: 'DIFF' was not declared in this scope
   52 | int F=max(sparseR[i][y1][LOG[y2-y1+1]],sparseR[i][y2-(1<<DIFF)+1][LOG[y2-y1+1]]);
      |                                                          ^~~~
rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:76:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 | for(int x=0;x<RE[i].size();x++){
      |             ~^~~~~~~~~~~~~