답안 #917486

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
917486 2024-01-28T10:15:24 Z 8pete8 UFO (IZhO14_ufo) C++17
95 / 100
2000 ms 144308 KB
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#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 endl "\n"
#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
using namespace std;
const int mod=1e9+7,mxn=1e6+5,Mxn=1e8,inf=1e18,minf=-1e18,lg=30;
int n,m,r,k,p;
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);	
}
struct seg{
    vector<int>v;
    void init(int n){v.resize(2*n+5,minf);}
    void update(int pos,int val,int n){
        pos+=n+1;
        v[pos]=val;
        for(int i=pos;i>0;i>>=1)v[i>>1]=max(v[i],v[i^1]);
    }
    int qry(int l,int r,int n){
        int ans=minf;
        for(l+=n+1,r+=n+1;l<=r;l>>=1,r>>=1){
            if(l&1)ans=max(ans,v[l++]);
            if(!(r&1))ans=max(ans,v[r--]);
        }
        return ans;
    }
}t[2][mxn+10];
int get1(int d,int h,int n,int p,int last){
    int l=last+1,r=n,mid=0,ans=inf;
    while(l<=r){
        mid=l+(r-l)/2;
        if(t[d][p].qry(last+1,mid,n)>=h)ans=min(ans,mid),r=mid-1;
        else l=mid+1;
    }
    return ans;
}
int get2(int d,int h,int n,int p,int last){
    int l=1,r=last-1,mid=0,ans=minf;
    while(l<=r){
        mid=l+(r-l)/2;
        if(t[d][p].qry(mid,last-1,n)>=h)ans=max(ans,mid),l=mid+1;
        else r=mid-1;
    }
    return ans;
}
int32_t main(){
    fastio
    cin>>n>>m>>r>>k>>p;
    vector<vector<int>>grid(n+1,vector<int>(m+1,0));
    for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)cin>>grid[i][j];
    for(int i=1;i<=n;i++){
        t[0][i].init(m);
        for(int j=1;j<=m;j++)t[0][i].update(j,grid[i][j],m);
    }
    for(int j=1;j<=m;j++){
        t[1][j].init(n);
        for(int i=1;i<=n;i++)t[1][j].update(i,grid[i][j],n);
    }
    int d=0,sz=0,cnt,last,x,y;
    bool yes=false;
    while(k--){
        char g;cin>>g;
        int p,h;cin>>p>>h;
        if(g=='W'||g=='E')d=0,sz=m;
        else d=1,sz=n;
        if(g=='W'||g=='N')yes=true,last=0;
        else yes=false,last=sz+1;
        cnt=r;
        while(cnt--){
            last=((yes)?get1(d,h,sz,p,last):get2(d,h,sz,p,last));
            if(last==inf||last==minf)break;
            x=p,y=last;
            if(d)swap(x,y);
            grid[x][y]--;
            t[0][x].update(y,grid[x][y],m);
            t[1][y].update(x,grid[x][y],n);
        }
    }
    for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)grid[i][j]+=grid[i][j-1];
    for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)grid[i][j]+=grid[i-1][j];
    int ans=0;
    for(int i=p;i<=n;i++)for(int j=p;j<=m;j++)ans=max(ans,grid[i][j]-grid[i-p][j]-grid[i][j-p]+grid[i-p][j-p]);
    cout<<ans;
}

Compilation message

ufo.cpp:31:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   31 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
ufo.cpp:36:23: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   36 | void setIO(string name){
      |                       ^
ufo.cpp:43:20: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   43 |     void init(int n){v.resize(2*n+5,minf);}
      |                    ^
ufo.cpp:44:38: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   44 |     void update(int pos,int val,int n){
      |                                      ^
ufo.cpp:49:30: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   49 |     int qry(int l,int r,int n){
      |                              ^
ufo.cpp:58:42: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   58 | int get1(int d,int h,int n,int p,int last){
      |                                          ^
ufo.cpp:67:42: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   67 | int get2(int d,int h,int n,int p,int last){
      |                                          ^
ufo.cpp:76:14: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   76 | int32_t main(){
      |              ^
ufo.cpp: In function 'void setIO(std::string)':
ufo.cpp:38:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ufo.cpp:39:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 47196 KB Output is correct
2 Correct 16 ms 47192 KB Output is correct
3 Correct 15 ms 47452 KB Output is correct
4 Correct 29 ms 47748 KB Output is correct
5 Correct 118 ms 50324 KB Output is correct
6 Correct 220 ms 68508 KB Output is correct
7 Correct 330 ms 96248 KB Output is correct
8 Correct 285 ms 94680 KB Output is correct
9 Correct 790 ms 91608 KB Output is correct
10 Correct 1154 ms 94280 KB Output is correct
11 Correct 802 ms 93580 KB Output is correct
12 Correct 1265 ms 94180 KB Output is correct
13 Correct 1310 ms 97872 KB Output is correct
14 Correct 903 ms 93864 KB Output is correct
15 Correct 1837 ms 94984 KB Output is correct
16 Correct 318 ms 94784 KB Output is correct
17 Execution timed out 2100 ms 99988 KB Time limit exceeded
18 Correct 330 ms 94800 KB Output is correct
19 Correct 651 ms 100504 KB Output is correct
20 Correct 1424 ms 144308 KB Output is correct