oj.uz

답안 #885875

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
885875 2023-12-10T22:52:20 Z MilosMilutinovic 무지개나라 (APIO17_rainbow) C++14
11 / 100
 106 ms 138580 KB 
#include "rainbow.h"
#include<bits/stdc++.h>
 
#define pb push_back
#define fi first
#define se second
#define mp make_pair
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
 
template <typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
 
int readint(){
	int x=0,f=1; char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
 
namespace perst{
	int root[4][200005],son[5000005][2],sum[500005],tsz;
	void modify(int&x,int f,int l,int r,int p,int v){
		x=++tsz; son[x][0]=son[f][0]; son[x][1]=son[f][1]; sum[x]=sum[f]+v;
		if(l==r) return;
		int mid=(l+r)/2;
		if(p<=mid) modify(son[x][0],son[f][0],l,mid,p,v);
		else modify(son[x][1],son[f][1],mid+1,r,p,v);
	}
	void modify(int t,int x,int y,int v){modify(root[t][x],root[t][x],1,200000,y,v);}
	int ask(int x,int l,int r,int ql,int qr){
		if(ql<=l&&r<=qr) return sum[x];
		int mid=(l+r)/2;
		if(qr<=mid) return ask(son[x][0],l,mid,ql,qr);
		else if(ql>mid) return ask(son[x][1],mid+1,r,ql,qr);
		else return ask(son[x][0],l,mid,ql,qr)+ask(son[x][1],mid+1,r,ql,qr);
	}
	int query(int t,int x1,int x2,int y1,int y2){
		if(x1>x2||y1>y2) return 0;
		return ask(root[t][x2],1,200000,y1,y2)-ask(root[t][x1-1],1,200000,y1,y2);
	}
};
 
int lx,ly,rx,ry;
vector<int> qs[4][200005];
 
void init(int r,int c,int sc,int sr,int m,char* s){
	lx=rx=sc;
	ly=ry=sr;
	qs[0][sc].pb(sr);
	qs[1][sc].pb(sr);
	qs[1][sc].pb(sr-1);
	qs[2][sc].pb(sr);
	qs[2][sc-1].pb(sr);
	qs[3][sc].pb(sr);
	qs[3][sc].pb(sr-1);
	qs[3][sc-1].pb(sr);
	qs[3][sc-1].pb(sr-1);
	for(int i=0;i<m;i++){
		if(s[i]=='N') sc--;
		if(s[i]=='S') sc++;
		if(s[i]=='E') sr++;
		if(s[i]=='W') sr--;
		lx=min(lx,sc);
		rx=max(rx,sc);
		ly=min(ly,sr);
		ry=max(ry,sr);
		qs[0][sc].pb(sr);
		qs[1][sc].pb(sr);
		qs[1][sc].pb(sr-1);
		qs[2][sc].pb(sr);
		qs[2][sc-1].pb(sr);
		qs[3][sc].pb(sr);
		qs[3][sc].pb(sr-1);
		qs[3][sc-1].pb(sr);
		qs[3][sc-1].pb(sr-1);
	}
	for(int i=1;i<=r;i++){
		for(int t=0;t<4;t++){
			perst::root[t][i]=perst::root[t][i-1];
			sort(qs[t][i].begin(),qs[t][i].end());
			qs[t][i].erase(unique(qs[t][i].begin(),qs[t][i].end()),qs[t][i].end());
			for(int j:qs[t][i]) if(1<=j&&j<=c) perst::modify(t,i,j,1);
		}	
	}
}
 
int colour(int x1,int y1,int x2,int y2){
	ll res=0;
	if(x1<lx&&rx<x2&&y1<ly&&ry<y2) res=1;
	res+=(x2-x1+1)*1ll*(y2-y1+1)-perst::query(0,x1,x2,y1,y2);
	res-=(x2-x1+1)*1ll*(y2-y1)-perst::query(1,x1,x2,y1,y2-1);
	res-=(x2-x1)*1ll*(y2-y1+1)-perst::query(2,x1,x2-1,y1,y2);
	res+=(x2-x1)*1ll*(y2-y1)-perst::query(3,x1,x2-1,y1,y2-1);
	return res;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 21084 KB Output is correct
2 Correct 6 ms 21852 KB Output is correct
3 Correct 6 ms 21340 KB Output is correct
4 Correct 6 ms 21340 KB Output is correct
5 Correct 8 ms 22108 KB Output is correct
6 Correct 5 ms 21112 KB Output is correct
7 Correct 5 ms 21096 KB Output is correct
8 Correct 7 ms 21108 KB Output is correct
9 Correct 4 ms 21084 KB Output is correct
10 Correct 5 ms 21092 KB Output is correct
11 Correct 6 ms 21496 KB Output is correct
12 Correct 6 ms 21784 KB Output is correct
13 Correct 7 ms 22108 KB Output is correct
14 Correct 8 ms 22616 KB Output is correct
15 Correct 5 ms 21084 KB Output is correct
16 Correct 4 ms 21084 KB Output is correct
17 Correct 5 ms 21088 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 21084 KB Output is correct
2 Correct 5 ms 21088 KB Output is correct
3 Runtime error 106 ms 134344 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 21084 KB Output is correct
2 Runtime error 99 ms 136420 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 21084 KB Output is correct
2 Correct 6 ms 21852 KB Output is correct
3 Correct 6 ms 21340 KB Output is correct
4 Correct 6 ms 21340 KB Output is correct
5 Correct 8 ms 22108 KB Output is correct
6 Correct 5 ms 21112 KB Output is correct
7 Correct 5 ms 21096 KB Output is correct
8 Correct 7 ms 21108 KB Output is correct
9 Correct 4 ms 21084 KB Output is correct
10 Correct 5 ms 21092 KB Output is correct
11 Correct 6 ms 21496 KB Output is correct
12 Correct 6 ms 21784 KB Output is correct
13 Correct 7 ms 22108 KB Output is correct
14 Correct 8 ms 22616 KB Output is correct
15 Correct 5 ms 21084 KB Output is correct
16 Correct 4 ms 21084 KB Output is correct
17 Correct 5 ms 21088 KB Output is correct
18 Runtime error 102 ms 138580 KB Execution killed with signal 11
19 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 21084 KB Output is correct
2 Correct 6 ms 21852 KB Output is correct
3 Correct 6 ms 21340 KB Output is correct
4 Correct 6 ms 21340 KB Output is correct
5 Correct 8 ms 22108 KB Output is correct
6 Correct 5 ms 21112 KB Output is correct
7 Correct 5 ms 21096 KB Output is correct
8 Correct 7 ms 21108 KB Output is correct
9 Correct 4 ms 21084 KB Output is correct
10 Correct 5 ms 21092 KB Output is correct
11 Correct 6 ms 21496 KB Output is correct
12 Correct 6 ms 21784 KB Output is correct
13 Correct 7 ms 22108 KB Output is correct
14 Correct 8 ms 22616 KB Output is correct
15 Correct 5 ms 21084 KB Output is correct
16 Correct 4 ms 21084 KB Output is correct
17 Correct 5 ms 21088 KB Output is correct
18 Runtime error 102 ms 138580 KB Execution killed with signal 11
19 Halted 0 ms 0 KB -