oj.uz

답안 #826741

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
826741 2023-08-16T01:19:32 Z jamezzz Cell Automaton (JOI23_cell) C++17
16 / 100
 204 ms 16060 KB 
#include <bits/stdc++.h>
using namespace std;

#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb push_back
#define INF 2023456789
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ll,ll> pll;

const int m=4000;

int n,k;
int num[2*m+5];
int grid[m+5][m+5];
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

int main(){
	sf("%d%d",&n,&k);
	vector<ii> v;
	bool st1=true,st2=true;
	for(int i=0;i<n;++i){
		int x,y;sf("%d%d",&x,&y);
		v.pb({x,y});
		st1=st1&&(max(abs(x),abs(y))<=1000);
		st2=st2&&(x==y);
	}
	if(false&&st1){
		memset(grid,-1,sizeof grid);
		queue<ii> q;
		for(auto[x,y]:v){
			x+=m/2;y+=m/2;
			grid[x][y]=0;
			q.push({x,y});
		}
		while(!q.empty()){
			auto[x,y]=q.front();q.pop();
			for(int i=0;i<4;++i){
				int nx=x+dx[i],ny=y+dy[i];
				if(nx<0||ny<0||nx>=m||ny>=m)continue;
				if(grid[nx][ny]!=-1)continue;
				grid[nx][ny]=grid[x][y]+1;
				q.push({nx,ny});
			}
		}
		for(int i=0;i<m;++i){
			for(int j=0;j<m;++j){
				++num[grid[i][j]];
			}
		}
		for(int i=0;i<k;++i){
			int x;sf("%d",&x);
			pf("%d\n",num[x]);
		}
	}
	else if(st2){
		set<pll> s;
		ll tot=0;
		priority_queue<pll,vector<pll>,greater<pll>> pq;
		sort(all(v));
		for(int i=0;i<sz(v);++i){
			v[i]={v[i].fi+v[i].se,0};
			ll x=v[i].fi;
			if(i!=0){
				ll pv=v[i-1].fi;
				pq.push({x-pv,pv});
			}
			s.insert({x,x});
		}
		for(int i=0;i<k;++i){
			int x;sf("%d",&x);
			if(x==0){
				pf("%d\n",n);
				continue;
			}
			int bonus=0;
			while(!pq.empty()&&pq.top().fi<=2*x){
				auto[d,v]=pq.top();
				pq.pop();
				if(d==2*x)++bonus;
				auto it=--(s.upper_bound({v,INF}));
				assert(next(it)!=s.begin());
				pll pr=*it;
				assert(pr.fi<=v&&v<=pr.se);
				it=s.erase(it);
				assert(it!=s.end());
				pll pr2=*it;
				s.erase(it);
				tot-=pr.se-pr.fi;
				tot-=pr2.se-pr2.fi;
				tot+=pr2.se-pr.fi;
				s.insert({pr.fi,pr2.se});
			}
			int num=sz(s);
			pf("%lld\n",(ll)num*4*x+tot+(ll)bonus*(x-1));
		}
	}
}

Compilation message

cell.cpp: In function 'int main()':
cell.cpp:24:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |  sf("%d%d",&n,&k);
      |    ^
cell.cpp:28:13: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |   int x,y;sf("%d%d",&x,&y);
      |             ^
cell.cpp:57:12: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |    int x;sf("%d",&x);
      |            ^
cell.cpp:76:12: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |    int x;sf("%d",&x);
      |            ^

Subtask #1
0 / 4.0

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

Subtask #2
0 / 12.0

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

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 8892 KB Output is correct
2 Correct 52 ms 8916 KB Output is correct
3 Correct 66 ms 8920 KB Output is correct
4 Correct 86 ms 8916 KB Output is correct
5 Correct 71 ms 8868 KB Output is correct
6 Correct 89 ms 8916 KB Output is correct
7 Correct 55 ms 8852 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 284 KB Output is correct
11 Correct 94 ms 8804 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 8892 KB Output is correct
2 Correct 52 ms 8916 KB Output is correct
3 Correct 66 ms 8920 KB Output is correct
4 Correct 86 ms 8916 KB Output is correct
5 Correct 71 ms 8868 KB Output is correct
6 Correct 89 ms 8916 KB Output is correct
7 Correct 55 ms 8852 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 284 KB Output is correct
11 Correct 94 ms 8804 KB Output is correct
12 Correct 194 ms 14428 KB Output is correct
13 Correct 199 ms 14396 KB Output is correct
14 Correct 191 ms 14396 KB Output is correct
15 Correct 191 ms 14412 KB Output is correct
16 Correct 91 ms 4956 KB Output is correct
17 Correct 92 ms 4912 KB Output is correct
18 Correct 109 ms 7736 KB Output is correct
19 Correct 204 ms 16060 KB Output is correct

Subtask #5
0 / 17.0

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

Subtask #6
0 / 25.0

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

Subtask #7
0 / 26.0

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