oj.uz

답안 #403706

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
403706 2021-05-13T11:29:13 Z jamezzz 조개 줍기 (KOI17_shell) C++14
0 / 100
 315 ms 30412 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#include <ext/rope>
using namespace __gnu_cxx;

typedef tree<long long, null_type, less<long long>,
rb_tree_tag, tree_order_statistics_node_update> pbds;
//less_equal for identical elements

//#define DEBUG

#ifdef DEBUG
#define debug(...) printf(__VA_ARGS__);
#else
#define debug(...)
#endif
#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb emplace_back
#define sz(x) (int)x.size()
#define mnto(x,y) x=min(x,(__typeof__(x))y)
#define mxto(x,y) x=max(x,(__typeof__(x))y)
#define INF 1023456789
#define LINF 1023456789123456789
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<pll> vll;

int n,a[1505][1505],x,y;
char t;
ll s=0,ft[1505][1505];

void up(int r,int c,ll v){
	while(c<=n){
		ft[r][c]+=v;
		c+=c&-c;
	}
}

ll qry(int r,int c){
	ll res=0;
	while(c){
		res+=ft[r][c];
		c-=c&-c;
	}
	return res;
}

int main(){
	sf("%d",&n);
	for(int i=1;i<=n;++i){
		for(int j=1;j<=n;++j){
			sf("%d",&a[i][j]);
			ll dp=a[i][j]+max(qry(i-1,j),qry(i,j-1));
			up(i,j,dp);
			up(i,j+1,-dp);
			s+=dp;
		}
	}
	pf("%lld\n",s);
	for(int i=0;i<n;++i){
		sf(" %c",&t);
		sf("%d%d",&x,&y);
		int add;
		if(t=='U')add=1;
		else add=-1;
		a[x][y]+=add;
		up(x,y,add),up(x,y+1,-add);
		int cl=y+1,cr=y+1;
		s+=add;
		for(int r=x;r<=n;++r){
			while(cl<=n){
				ll pv=qry(r,cl);
				ll nw=a[r][cl]+max(qry(r,cl-1),qry(r-1,cl));
				if(pv==nw)++cl;
				else break;
			}
			while(cr<=n){
				ll pv=qry(r,cr);
				ll nw=a[r][cr]+max(qry(r,cr-1),qry(r-1,cr));
				if(pv!=nw)++cr;
				else break;
			}
			if(cr<=cl)break;
			up(r,cl,add);
			up(r,cr,-add);
			s+=(cr-cl)*add;
		}
		pf("%lld\n",s);
	}
}

/*
3
3 1 1
1 1 1
1 1 1
U 2 1
U 1 2
U 1 2
*/

Compilation message

shell.cpp: In function 'int main()':
shell.cpp:62:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |  sf("%d",&n);
      |    ^
shell.cpp:65:6: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |    sf("%d",&a[i][j]);
      |      ^
shell.cpp:74:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |   sf(" %c",&t);
      |     ^
shell.cpp:75:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |   sf("%d%d",&x,&y);
      |     ^

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 1228 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 315 ms 30412 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 1228 KB Output isn't correct
2 Halted 0 ms 0 KB -