oj.uz

답안 #22535

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
22535 2017-04-30T05:24:02 Z dhsrhkdgus(#943, kjp4155, cok1973, dhsrhkdgus) Window XOR (KRIII5_WX) C++14
7 / 7
 496 ms 5028 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll,ll> Pll;

#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define rep(i, n) for(int i=0;i<n;i++)
#define repp(i, n) for(int i=1;i<=n;i++)
#define all(x) x.begin(), x.end()

#define ABS(x) (((x) > 0 ) ? (x) : (-(x)))
#define MAX2(x, y) (((x) > (y)) ? (x) : (y))
#define MIN2(x, y) (((x) < (y)) ? (x) : (y))

#define MAX3(x, y, z) ( (x) > (y)  ? ( (x) > (z) ? (x) : (z)  ) : ( (y) > (z) ? (y) : (z) )  )
#define MIN3(x, y, z) ( (x) < (y)  ? ( (x) < (z) ? (x) : (z)  ) : ( (y) < (z) ? (y) : (z) )  )
#define MID3(val1,val2,val3) MAX2(MIN2(MAX2(val1,val2),val3),MIN2(val1,val2))

#define geti1(X) scanf("%d",&X)
#define geti2(X,Y) scanf("%d%d",&X,&Y)
#define geti3(X,Y,Z) scanf("%d%d%d",&X,&Y,&Z)
#define geti4(X,Y,Z,W) scanf("%d%d%d%d",&X,&Y,&Z,&W)

#define GET_MACRO(_1,_2,_3,_4,NAME,...) NAME
#define geti(...) GET_MACRO(__VA_ARGS__, geti4, geti3, geti2, geti1) (__VA_ARGS__)

#define INF 987654321
#define IINF 987654321987654321

ll N,M,T,K,H;
ll d;

ll fpow(ll x, ll a){
	ll res = 1; ll t = x;
	while( a > 0 ){
		if( a&1 ) res  = ( res * t ) % N;
		t = (t * t) % N;
		a >>= 1;
	}
	return res;
}
int p[100500]; ll L;
ll gcd(ll a, ll b ){
	if( b == 0 ) return a;
	return gcd( b , a % b );
}
int ans[100500]; bool vis[100500];
void solve(int t){
	memset(vis,0,sizeof vis);

	d = fpow(2,t);
	L = N/gcd(d,N);
	rep(i,N)if( !vis[i] ){
		ll tot = 0;
		vector<Pi> v;
		for(int j=0;j<L;j++){
			v.push_back({(i+j*d)%N, p[(i+j*d)%N]});
			vis[(i+j*d)%N] = 1;
			tot ^= v[v.size()-1].Se;
		}
		//for(auto e : v ) printf("%d ",e.Se);
		//printf("\n");
		int a = 0;
		if( (K/L)%2 == 0 ){
			int last = 0;
			for(int j=0;j<K%L;j++){
				a ^= v[j].Se;
				last = j;
			//	printf("%d in %d out \n",v[j].Fi,-1);
			}
			ans[v[0].Fi] = a;
			//printf("%d\n",a);
			for(int j=1;j<=L-1;j++){
				a ^= v[j-1].Se;
				a ^= v[(last+j)%L].Se;

				//printf("%d in %d out \n",v[(last+j)%L].Se,v[j-1].Se);
				ans[v[j].Fi] = a;
			//	printf("%d\n",a);
			}

		}
		else{
			
			int last = -1;
			a = tot;
			for(int j=0;j<K%L;j++){
				a ^= v[j].Se;
				last = j;
			//	printf("%d in %d out \n",v[j].Fi,-1);
			}
			ans[v[0].Fi] = a;
			//cout << last << endl;
			//printf("%d\n",tot);
			for(int j=1;j<=L-1;j++){
				a ^= v[j-1].Se;
				a ^= v[(last+j)%L].Se;
				//printf("!%d %d\n",(last+j)%L, j-1);
				//printf("%d in %d out \n",v[(last+j)%L].Se,v[j-1].Se);
				ans[v[j].Fi] = a;
			//	printf("%d\n",a);
			}
			
		}

	}
	rep(i,N) p[i] = ans[i];
}

int main(void){
	cin >> N >> K >> T;
	rep(i,N) geti(p[i]);
	int k = 0;
	while(T>0){
		if( T & 1 ) solve(k);
		k = k+1;
		T >>= 1;
	}
	rep(i,N) printf("%d ",ans[i]);
}

Compilation message

WX.cpp: In function 'int main()':
WX.cpp:132:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  rep(i,N) geti(p[i]);
                     ^

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2904 KB Output is correct
2 Correct 0 ms 2904 KB Output is correct
3 Correct 0 ms 2904 KB Output is correct
4 Correct 293 ms 5028 KB Output is correct
5 Correct 33 ms 4524 KB Output is correct
6 Correct 279 ms 4524 KB Output is correct
7 Correct 29 ms 4524 KB Output is correct
8 Correct 276 ms 4524 KB Output is correct
9 Correct 286 ms 4524 KB Output is correct
10 Correct 273 ms 5028 KB Output is correct
11 Correct 266 ms 5028 KB Output is correct
12 Correct 299 ms 3756 KB Output is correct
13 Correct 293 ms 3756 KB Output is correct
14 Correct 149 ms 4004 KB Output is correct
15 Correct 153 ms 4004 KB Output is correct
16 Correct 453 ms 4524 KB Output is correct
17 Correct 496 ms 4524 KB Output is correct
18 Correct 163 ms 3756 KB Output is correct
19 Correct 163 ms 3756 KB Output is correct
20 Correct 176 ms 5028 KB Output is correct
21 Correct 176 ms 4524 KB Output is correct
22 Correct 166 ms 5028 KB Output is correct
23 Correct 159 ms 4524 KB Output is correct
24 Correct 179 ms 5028 KB Output is correct
25 Correct 196 ms 4524 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 269 ms 4524 KB Output is correct
2 Correct 133 ms 3044 KB Output is correct
3 Correct 216 ms 4524 KB Output is correct
4 Correct 269 ms 4524 KB Output is correct
5 Correct 286 ms 4524 KB Output is correct
6 Correct 139 ms 5028 KB Output is correct
7 Correct 163 ms 5028 KB Output is correct
8 Correct 289 ms 4524 KB Output is correct
9 Correct 256 ms 4524 KB Output is correct
10 Correct 306 ms 3756 KB Output is correct
11 Correct 69 ms 4004 KB Output is correct
12 Correct 99 ms 4004 KB Output is correct
13 Correct 26 ms 3176 KB Output is correct
14 Correct 26 ms 3176 KB Output is correct
15 Correct 299 ms 4524 KB Output is correct
16 Correct 23 ms 3176 KB Output is correct
17 Correct 263 ms 4524 KB Output is correct
18 Correct 23 ms 3176 KB Output is correct
19 Correct 266 ms 4524 KB Output is correct
20 Correct 23 ms 3176 KB Output is correct
21 Correct 139 ms 4524 KB Output is correct
22 Correct 19 ms 3176 KB Output is correct
23 Correct 249 ms 4524 KB Output is correct
24 Correct 286 ms 5028 KB Output is correct
25 Correct 16 ms 3236 KB Output is correct
26 Correct 266 ms 5028 KB Output is correct
27 Correct 23 ms 3236 KB Output is correct
28 Correct 273 ms 5028 KB Output is correct
29 Correct 23 ms 3236 KB Output is correct
30 Correct 303 ms 5028 KB Output is correct
31 Correct 33 ms 3236 KB Output is correct
32 Correct 269 ms 5028 KB Output is correct
33 Correct 23 ms 3236 KB Output is correct
34 Correct 256 ms 4524 KB Output is correct
35 Correct 263 ms 4524 KB Output is correct
36 Correct 263 ms 4524 KB Output is correct
37 Correct 279 ms 4524 KB Output is correct
38 Correct 279 ms 4524 KB Output is correct
39 Correct 279 ms 4524 KB Output is correct
40 Correct 276 ms 4524 KB Output is correct
41 Correct 119 ms 4524 KB Output is correct
42 Correct 249 ms 4524 KB Output is correct
43 Correct 283 ms 4524 KB Output is correct
44 Correct 443 ms 4524 KB Output is correct
45 Correct 436 ms 4524 KB Output is correct
46 Correct 459 ms 4524 KB Output is correct
47 Correct 479 ms 4524 KB Output is correct
48 Correct 473 ms 4524 KB Output is correct
49 Correct 269 ms 4524 KB Output is correct
50 Correct 433 ms 4524 KB Output is correct
51 Correct 463 ms 4524 KB Output is correct
52 Correct 486 ms 4524 KB Output is correct
53 Correct 436 ms 4524 KB Output is correct
54 Correct 283 ms 3756 KB Output is correct
55 Correct 286 ms 3756 KB Output is correct
56 Correct 149 ms 3756 KB Output is correct
57 Correct 326 ms 3756 KB Output is correct
58 Correct 329 ms 3756 KB Output is correct
59 Correct 193 ms 3756 KB Output is correct
60 Correct 193 ms 3756 KB Output is correct
61 Correct 183 ms 3756 KB Output is correct
62 Correct 176 ms 3756 KB Output is correct
63 Correct 183 ms 3756 KB Output is correct
64 Correct 163 ms 3756 KB Output is correct
65 Correct 93 ms 3756 KB Output is correct
66 Correct 133 ms 5028 KB Output is correct
67 Correct 206 ms 4524 KB Output is correct
68 Correct 189 ms 5028 KB Output is correct
69 Correct 173 ms 4524 KB Output is correct
70 Correct 183 ms 5028 KB Output is correct
71 Correct 189 ms 4524 KB Output is correct
72 Correct 189 ms 5028 KB Output is correct
73 Correct 196 ms 4524 KB Output is correct
74 Correct 196 ms 5028 KB Output is correct
75 Correct 203 ms 4524 KB Output is correct
76 Correct 0 ms 2904 KB Output is correct
77 Correct 0 ms 2904 KB Output is correct
78 Correct 0 ms 2904 KB Output is correct
79 Correct 293 ms 5028 KB Output is correct
80 Correct 33 ms 4524 KB Output is correct
81 Correct 279 ms 4524 KB Output is correct
82 Correct 29 ms 4524 KB Output is correct
83 Correct 276 ms 4524 KB Output is correct
84 Correct 286 ms 4524 KB Output is correct
85 Correct 273 ms 5028 KB Output is correct
86 Correct 266 ms 5028 KB Output is correct
87 Correct 299 ms 3756 KB Output is correct
88 Correct 293 ms 3756 KB Output is correct
89 Correct 149 ms 4004 KB Output is correct
90 Correct 153 ms 4004 KB Output is correct
91 Correct 453 ms 4524 KB Output is correct
92 Correct 496 ms 4524 KB Output is correct
93 Correct 163 ms 3756 KB Output is correct
94 Correct 163 ms 3756 KB Output is correct
95 Correct 176 ms 5028 KB Output is correct
96 Correct 176 ms 4524 KB Output is correct
97 Correct 166 ms 5028 KB Output is correct
98 Correct 159 ms 4524 KB Output is correct
99 Correct 179 ms 5028 KB Output is correct
100 Correct 196 ms 4524 KB Output is correct