oj.uz

답안 #56250

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
56250 2018-07-10T15:55:36 Z hamzqq9 Dojave (COCI17_dojave) C++14
140 / 140
 3316 ms 126900 KB 
#include<bits/stdc++.h>
#define lf double
#define ll long long
#define ull unsigned ll
#define ii pair<int,int>
#define li pair<ll,int>
#define iii pair<ii,int>
#define iiii pair<ii,ii>
#define iiii2 pair<int,iii>
#define lii pair<ll,ii>
#define lolo pair<ll,ll>
#define heap priority_queue
#define mp make_pair
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define all(x) x.begin(),x.end()
#define len(x) strlen(x)
#define sz(x) (int) x.size()
#define orta ((bas+son)/2)
#define min3(x,y,z) min(min(x,y),z)
#define max3(x,y,z) max(max(x,y),z)
#define umin(x,y) x=min(x,y)
#define umax(x,y) x=max(x,y)
#define dbgs(x) cerr<<(#x)<<" --> "<<(x)<<" "
#define dbg(x) cerr<<(#x)<<" --> "<<(x)<<endl;getchar()
#define MOD 1000000007
#define inf 1000000001
#define N pw(21)
#define LOG 20
#define magic 100
#define MAX 1000005
#define KOK 350
#define EPS 0.000000000001
#define pw(x) (1<<(x))
#define PI 3.1415926535
using namespace std;

struct SEG {
		
	int mn[4],cnt[4];

} S[N*4];

int n,x;
int lazy[N*4],pos[N],match[N];
bool ok[N];
ll NO;

void push(int node,int bas,int son) {

	for(int i=0;i<4;i++) {

		S[node*2].mn[i]+=lazy[node];
		S[node*2+1].mn[i]+=lazy[node];

	}
	
	lazy[node*2]+=lazy[node];
	lazy[node*2+1]+=lazy[node];
	
	lazy[node]=0;

}

SEG merge(SEG A,SEG B) {

	SEG result;

	for(int i=0;i<4;i++) {

		result.cnt[i]=0;

		result.mn[i]=min(A.mn[i],B.mn[i]);

		if(A.mn[i]==result.mn[i]) result.cnt[i]+=A.cnt[i];
		if(B.mn[i]==result.mn[i]) result.cnt[i]+=B.cnt[i];

	}

	return result;	

}

SEG get(int node,int bas,int son,int x,int y) {

	if(bas>=x && son<=y) return S[node];

	push(node,bas,son);

	if(orta>=x) {

		if(orta+1<=y) {

			return merge(get(node*2,bas,orta,x,y),get(node*2+1,orta+1,son,x,y));

		}
		else return get(node*2,bas,orta,x,y);

	}
	else return get(node*2+1,orta+1,son,x,y);

}

void up(int node,int bas,int son,int x,int y,int val) {

	if(bas>y || son<x) return ;

	if(bas>=x && son<=y) {

		for(int i=0;i<4;i++) S[node].mn[i]+=val;

		lazy[node]+=val;

		return ;

	}

	push(node,bas,son);

	up(node*2,bas,orta,x,y,val);
	up(node*2+1,orta+1,son,x,y,val);

	S[node]=merge(S[node*2],S[node*2+1]);

}

void build(int node,int bas,int son) {

	if(bas==son) {

		for(int i=0;i<4;i++) S[node].cnt[i]=0,S[node].mn[i]=1;

		S[node].mn[bas%4]=0;
		S[node].cnt[bas%4]=1;

		return ;

	}

	build(node*2,bas,orta);
	build(node*2+1,orta+1,son);

	S[node]=merge(S[node*2],S[node*2+1]);

}

int main() {

	#if 0

	freopen("input.txt","r",stdin);

	#endif

	scanf("%d",&n);

	for(int i=1;i<=pw(n);i++) {

		scanf("%d",&x);

		pos[x]=i;

	}

	for(int i=0;i<pw(n);i++) {

		match[pos[i]]=pos[pw(n)-1-i];

	}

	build(1,1,pw(n));

	for(int i=1;i<=pw(n);i++) {

		if(!ok[match[i]]) {

			up(1,1,pw(n),1,i,1);

		}
		else {

			up(1,1,pw(n),1,match[i],-1);

			up(1,1,pw(n),match[i]+1,i,1);

		}

		SEG RES=get(1,1,pw(n),1,i);

		if(RES.mn[(i+1)%4]==0) NO+=RES.cnt[(i+1)%4];

		ok[i]=1;

	}

	printf("%lld",1ll*pw(n)*(pw(n)+1)/2-NO-(n==1));

}

Compilation message

dojave.cpp: In function 'int main()':
dojave.cpp:159:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
dojave.cpp:163:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&x);
   ~~~~~^~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 2 ms 488 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 488 KB Output is correct
2 Correct 3 ms 520 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 908 KB Output is correct
2 Correct 9 ms 908 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 1216 KB Output is correct
2 Correct 15 ms 1240 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 2008 KB Output is correct
2 Correct 27 ms 2116 KB Output is correct
3 Correct 29 ms 2208 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 137 ms 6048 KB Output is correct
2 Correct 168 ms 6460 KB Output is correct
3 Correct 289 ms 12504 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 134 ms 12504 KB Output is correct
2 Correct 329 ms 13296 KB Output is correct
3 Correct 522 ms 25324 KB Output is correct

Subtask #8
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 760 ms 25368 KB Output is correct
2 Correct 580 ms 27152 KB Output is correct
3 Correct 574 ms 28848 KB Output is correct

Subtask #9
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3316 ms 91240 KB Output is correct
2 Correct 2586 ms 98384 KB Output is correct
3 Correct 2169 ms 105456 KB Output is correct

Subtask #10
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3124 ms 105484 KB Output is correct
2 Correct 2627 ms 112444 KB Output is correct
3 Correct 2246 ms 119676 KB Output is correct
4 Correct 2967 ms 126900 KB Output is correct