제출 #1165228

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1165228		8pete8	Strah (COCI18_strah)	C++20	110 / 110	242 ms	67544 KiB

strah

#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<cassert>
#include<unordered_map>
#include <queue>
#include <cstdint>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-lopps")
#define int long long
#define double long double
using namespace std;
const int mod=998244353,mxn=2e3+5,inf=1e18,minf=-1e18,lg=30;
//#undef int
int n,k,m,x,q;
void setIO(string name){		
	ios_base::sync_with_stdio(0); cin.tie(0);		
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}
char grid[mxn+10][mxn+10];
int U[mxn+10][mxn+10],D[mxn+10][mxn+10];
int L[mxn+10],R[mxn+10];
int ans=0;
int getsum(int a){
	return (a*(a+1)/2);
}
int get(int L,int M,int R){
	return ((getsum(R)-getsum(M-1))*(M-L+1)-(getsum(M)-getsum(L-1))*(R-M+1))+(R-M+1)*(M-L+1);
}
int32_t main(){
    fastio;
	cin>>n>>m;
	for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)cin>>grid[i][j];
	for(int j=1;j<=m;j++){
		for(int i=1;i<=n;i++){
			if(grid[i][j]=='#')U[i][j]=i;
			else U[i][j]=U[i-1][j];
		}
		D[n+1][j]=n+1;
		for(int i=n;i>=1;i--){
			if(grid[i][j]=='#')D[i][j]=i;
			else D[i][j]=D[i+1][j];
		}
	}
	for(int i=1;i<=n;i++){
		stack<int>st;
		for(int j=1;j<=m;j++)L[j]=R[j]=j;
		for(int j=1;j<=m;j++){
			while(!st.empty()&&U[i][st.top()]<=U[i][j])st.pop();
			if(st.size())L[j]=st.top()+1;
			else L[j]=1;
			st.push(j);
		}
		while(!st.empty())st.pop();
		for(int j=m;j>=1;j--){
			while(!st.empty()&&U[i][st.top()]<U[i][j])st.pop();
			if(st.size())R[j]=st.top()-1;
			else R[j]=m;
			st.push(j);
		}
		while(!st.empty())st.pop();
		for(int j=1;j<=m;j++){
			if(grid[i][j]=='#')continue;
			ans+=getsum(i-U[i][j])*get(L[j],j,R[j]);
		}

	}
	cout<<ans;
}

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

strah.cpp:32:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   32 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
strah.cpp:39:23: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   39 | void setIO(string name){
      |                       ^
strah.cpp:48:17: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   48 | int getsum(int a){
      |                 ^
strah.cpp:51:26: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   51 | int get(int L,int M,int R){
      |                          ^
strah.cpp:54:14: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   54 | int32_t main(){
      |              ^
strah.cpp: In function 'void setIO(std::string)':
strah.cpp:41:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |         freopen((name+".in").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
strah.cpp:42:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |         freopen((name+".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 11 / 11
• Subtask 5: 11 / 11
• Subtask 6: 11 / 11
• Subtask 7: 11 / 11
• Subtask 8: 11 / 11
• Subtask 9: 11 / 11
• Subtask 10: 11 / 11