oj.uz

답안 #22801

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
22801 2017-04-30T07:33:21 Z 버거킹 송죽SK점 우수고객(#1039, Namnamseo, khsoo01) Window XOR (KRIII5_WX) C++11
7 / 7
 279 ms 3288 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
typedef pair<ll,ll> pll;
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define x first
#define y second

int n, k;
ll t;
int a[2][100010];
bool found[100010];

int cyc[100010];
int cn;

void trans(int h, int F, int T){
	ll w = (1ll << h) % n;
	if(w == 0){
		if(k%2 == 0) for(int i=0; i<n; ++i) a[T][i]=0;
		else for(int i=0; i<n; ++i) a[T][i]=a[F][i];
		return;
	}
	fill(found, found+n, false);
	for(int i=0; i<n; ++i) if(!found[i]){
		cn=0;
		for(int j=i;;){
			if(found[j]) break;
			cyc[cn++]=j;
			found[j]=1;
			j=(j+w)%n;
		}
		int init_k = k % (2*cn);
		int val=0;
		int l=0, r=init_k % cn;
		for(int i=0; i<init_k; ++i){
			val ^= a[F][cyc[i%cn]];
		}
		for(int i=0; i<cn; ++i){
			a[T][cyc[i]] = val;
			val ^= a[F][cyc[l]];
			val ^= a[F][cyc[r]];
			l=(l+1)%cn;
			r=(r+1)%cn;
		}
	}
}

//#define DBG
int main()
{
	#ifdef DBG
	freopen("out.txt", "w", stdout);
	n=1e5; k=n/2; t=12345678987654;
	#else
	scanf("%d%d%lld", &n, &k, &t);
	#endif
	int F=0, T=1;
	for(int i=0; i<n; ++i){
		#ifdef DBG
		a[F][i]=rand()%int(1e9);
		#else
		scanf("%d", &a[F][i]);
		#endif
	}
	for(int i=62; 0<=i; --i){
		if(1 & (t>>i)){
			trans(i, F, T);
			swap(F, T);
		}
	}
	for(int i=0; i<n; ++i){
		printf("%d ", a[F][i]);
	}
    return 0;
}

Compilation message

WX.cpp: In function 'int main()':
WX.cpp:58:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%lld", &n, &k, &t);
                               ^
WX.cpp:65:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[F][i]);
                        ^

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3288 KB Output is correct
2 Correct 0 ms 3288 KB Output is correct
3 Correct 0 ms 3288 KB Output is correct
4 Correct 236 ms 3288 KB Output is correct
5 Correct 33 ms 3288 KB Output is correct
6 Correct 229 ms 3288 KB Output is correct
7 Correct 26 ms 3288 KB Output is correct
8 Correct 226 ms 3288 KB Output is correct
9 Correct 229 ms 3288 KB Output is correct
10 Correct 233 ms 3288 KB Output is correct
11 Correct 233 ms 3288 KB Output is correct
12 Correct 53 ms 3288 KB Output is correct
13 Correct 49 ms 3288 KB Output is correct
14 Correct 139 ms 3288 KB Output is correct
15 Correct 153 ms 3288 KB Output is correct
16 Correct 209 ms 3288 KB Output is correct
17 Correct 209 ms 3288 KB Output is correct
18 Correct 136 ms 3288 KB Output is correct
19 Correct 133 ms 3288 KB Output is correct
20 Correct 159 ms 3288 KB Output is correct
21 Correct 153 ms 3288 KB Output is correct
22 Correct 156 ms 3288 KB Output is correct
23 Correct 139 ms 3288 KB Output is correct
24 Correct 149 ms 3288 KB Output is correct
25 Correct 149 ms 3288 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 223 ms 3288 KB Output is correct
2 Correct 96 ms 3288 KB Output is correct
3 Correct 163 ms 3288 KB Output is correct
4 Correct 223 ms 3288 KB Output is correct
5 Correct 216 ms 3288 KB Output is correct
6 Correct 123 ms 3288 KB Output is correct
7 Correct 133 ms 3288 KB Output is correct
8 Correct 219 ms 3288 KB Output is correct
9 Correct 223 ms 3288 KB Output is correct
10 Correct 59 ms 3288 KB Output is correct
11 Correct 66 ms 3288 KB Output is correct
12 Correct 76 ms 3288 KB Output is correct
13 Correct 19 ms 3288 KB Output is correct
14 Correct 19 ms 3288 KB Output is correct
15 Correct 266 ms 3288 KB Output is correct
16 Correct 23 ms 3288 KB Output is correct
17 Correct 236 ms 3288 KB Output is correct
18 Correct 23 ms 3288 KB Output is correct
19 Correct 229 ms 3288 KB Output is correct
20 Correct 26 ms 3288 KB Output is correct
21 Correct 146 ms 3288 KB Output is correct
22 Correct 26 ms 3288 KB Output is correct
23 Correct 253 ms 3288 KB Output is correct
24 Correct 276 ms 3288 KB Output is correct
25 Correct 19 ms 3288 KB Output is correct
26 Correct 249 ms 3288 KB Output is correct
27 Correct 23 ms 3288 KB Output is correct
28 Correct 233 ms 3288 KB Output is correct
29 Correct 23 ms 3288 KB Output is correct
30 Correct 233 ms 3288 KB Output is correct
31 Correct 23 ms 3288 KB Output is correct
32 Correct 233 ms 3288 KB Output is correct
33 Correct 23 ms 3288 KB Output is correct
34 Correct 236 ms 3288 KB Output is correct
35 Correct 266 ms 3288 KB Output is correct
36 Correct 259 ms 3288 KB Output is correct
37 Correct 266 ms 3288 KB Output is correct
38 Correct 276 ms 3288 KB Output is correct
39 Correct 253 ms 3288 KB Output is correct
40 Correct 243 ms 3288 KB Output is correct
41 Correct 133 ms 3288 KB Output is correct
42 Correct 279 ms 3288 KB Output is correct
43 Correct 243 ms 3288 KB Output is correct
44 Correct 216 ms 3288 KB Output is correct
45 Correct 193 ms 3288 KB Output is correct
46 Correct 229 ms 3288 KB Output is correct
47 Correct 216 ms 3288 KB Output is correct
48 Correct 209 ms 3288 KB Output is correct
49 Correct 123 ms 3288 KB Output is correct
50 Correct 206 ms 3288 KB Output is correct
51 Correct 219 ms 3288 KB Output is correct
52 Correct 216 ms 3288 KB Output is correct
53 Correct 223 ms 3288 KB Output is correct
54 Correct 53 ms 3288 KB Output is correct
55 Correct 63 ms 3288 KB Output is correct
56 Correct 29 ms 3288 KB Output is correct
57 Correct 56 ms 3288 KB Output is correct
58 Correct 63 ms 3288 KB Output is correct
59 Correct 133 ms 3288 KB Output is correct
60 Correct 163 ms 3288 KB Output is correct
61 Correct 169 ms 3288 KB Output is correct
62 Correct 163 ms 3288 KB Output is correct
63 Correct 139 ms 3288 KB Output is correct
64 Correct 156 ms 3288 KB Output is correct
65 Correct 79 ms 3288 KB Output is correct
66 Correct 119 ms 3288 KB Output is correct
67 Correct 183 ms 3288 KB Output is correct
68 Correct 166 ms 3288 KB Output is correct
69 Correct 163 ms 3288 KB Output is correct
70 Correct 166 ms 3288 KB Output is correct
71 Correct 169 ms 3288 KB Output is correct
72 Correct 173 ms 3288 KB Output is correct
73 Correct 153 ms 3288 KB Output is correct
74 Correct 176 ms 3288 KB Output is correct
75 Correct 183 ms 3288 KB Output is correct
76 Correct 0 ms 3288 KB Output is correct
77 Correct 0 ms 3288 KB Output is correct
78 Correct 0 ms 3288 KB Output is correct
79 Correct 236 ms 3288 KB Output is correct
80 Correct 33 ms 3288 KB Output is correct
81 Correct 229 ms 3288 KB Output is correct
82 Correct 26 ms 3288 KB Output is correct
83 Correct 226 ms 3288 KB Output is correct
84 Correct 229 ms 3288 KB Output is correct
85 Correct 233 ms 3288 KB Output is correct
86 Correct 233 ms 3288 KB Output is correct
87 Correct 53 ms 3288 KB Output is correct
88 Correct 49 ms 3288 KB Output is correct
89 Correct 139 ms 3288 KB Output is correct
90 Correct 153 ms 3288 KB Output is correct
91 Correct 209 ms 3288 KB Output is correct
92 Correct 209 ms 3288 KB Output is correct
93 Correct 136 ms 3288 KB Output is correct
94 Correct 133 ms 3288 KB Output is correct
95 Correct 159 ms 3288 KB Output is correct
96 Correct 153 ms 3288 KB Output is correct
97 Correct 156 ms 3288 KB Output is correct
98 Correct 139 ms 3288 KB Output is correct
99 Correct 149 ms 3288 KB Output is correct
100 Correct 149 ms 3288 KB Output is correct