QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #305703 | #8017. 计算 | OccDreamer | 0 | 0ms | 0kb | C++14 | 2.5kb | 2024-01-15 20:48:03 | 2024-01-15 20:48:04 |
answer
//code by Nobody.Emissary
#include<bits/stdc++.h>
#define fi first
#define se second
#define vc vector
#define db double
#define ll long long
#define mk make_pair
#define pb push_back
#define PI pair<int,int>
#define ull unsigned long long
#define err cerr << " -_- " << endl
#define debug cerr << " ------------------- " << endl
#define input(x) freopen(#x".in","r",stdin)
#define output(x) freopen(#x".out","w",stdout)
#define NO puts("No")
#define YES puts("Yes")
//#define int long long
using namespace std;
namespace IO{
inline int read(){
int X=0, W=0; char ch=getchar();
while(!isdigit(ch)) W|=ch=='-', ch=getchar();
while(isdigit(ch)) X=(X<<1)+(X<<3)+(ch^48), ch=getchar();
return W?-X:X;
}
inline void write(int x){
if(x<0) x=-x, putchar('-');
if(x>9) write(x/10);
putchar(x%10+'0');
}
inline void sprint(int x){write(x), putchar(32);}
inline void eprint(int x){write(x), putchar(10);}
}using namespace IO;
const int MAXN = 1 << 11;
//const int mod = 1e9+7;
int N, n;
int mp[MAXN][MAXN];
inline int mod(int x, int t){
if(x>=0 && x<t) return x;
if(x<0) return t+x;
return x-t;
}
inline vc<int> construct(int N, vc<int> cur){
if(N==4){
vc<int> res;
for(int i=0;i<N*N;++i) res.pb(0);
for(int i=0;i<N*N;++i)
if(cur[i]==1){
int x=i/N, y=i%N;
res[mod(x-1,N)*N+y]^=1; res[mod(x+1,N)*N+y]^=1; res[x*N+mod(y-1,N)]^=1; res[x*N+mod(y+1,N)]^=1; res[i]^=1;
}
return res;
}
vc<int> mp[2][2], res[2][2], Res, answer;
for(int i=0;i<N*N;++i) Res.pb(0), answer.pb(0);
for(int i=0;i<N;++i)
for(int j=0;j<N;++j) mp[i&1][j&1].pb(cur[i*N+j]);
for(int i=0;i<2;++i)
for(int j=0;j<2;++j) res[i][j]=construct(N>>1,mp[i][j]);
for(int i=N-1;i>=0;--i){
for(int j=N-1;j>=0;--j){
Res[i*N+j]=res[i&1][j&1].back();
res[i&1][j&1].pop_back();
}
}
for(int i=0;i<N*N;++i)
if(Res[i]==1){
int x=i/N, y=i%N;
answer[mod(x-1,N)*N+y]^=1; answer[mod(x+1,N)*N+y]^=1; answer[x*N+mod(y-1,N)]^=1; answer[x*N+mod(y+1,N)]^=1; answer[i]^=1;
}
return answer;
}
signed main(){
n=read(); N=1<<n; vc<int> now;
for(int i=0;i<N;++i)
for(int j=0;j<N;++j) mp[i][j]=read(), now.pb(mp[i][j]);
vc<int> ans=construct(N,now);
int tot=0; for(auto i:ans) tot+=i==1;
eprint(tot);
for(int i=0;i<ans.size();++i)
if(ans[i]==1) sprint(i/N), eprint(i%N);
return 0;
}
/*
1 0 0 0
0 0 0 0
1 0 0 0
1 1 0 1
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Memory Limit Exceeded
input:
1 2 0 0 1 1
output:
result:
Test #2:
score: 0
Time Limit Exceeded
input:
10000 9026580 948 269 622 88 9346507 381 242 826 606 9266080 948 589 28 666 8566088 808 523 402 338 9832014 278 123 146 1000 8000150 613 878 146 740 8296526 404 147 608 398 9062880 494 203 336 382 9375271 823 736 54 676 8465119 505 414 874 772 9535971 784 983 426 802 8258325 817 977 172 862 9656017 ...
output:
result:
Test #3:
score: 0
Time Limit Exceeded
input:
10000 9060194 192 71 24 178 8861291 135 338 24 794 8800613 173 760 704 362 9878509 367 418 58 964 8183946 856 951 406 316 8087229 458 105 770 342 8269502 205 147 614 334 8877019 851 143 206 10 9044859 710 949 210 584 8887395 571 856 550 428 8208494 383 628 74 646 9949585 697 450 794 738 9938335 224 ...
output:
result:
Test #4:
score: 0
Time Limit Exceeded
input:
10000 9110615 854 153 494 298 9386442 749 922 386 696 9270958 160 53 630 562 9643022 573 997 226 836 9824638 357 16 34 332 9962202 439 312 40 854 8974913 815 436 710 876 9362731 411 272 998 760 9814831 220 961 962 274 9310979 19 890 782 588 9425378 897 14 212 870 9572172 430 419 334 166 9101141 565 ...
output:
result:
Test #5:
score: 0
Time Limit Exceeded
input:
4 3 4 5 6 1 2 6 1 8 10 4 1 4 2 2 5 0 10 2 10
output:
result:
Test #6:
score: 0
Time Limit Exceeded
input:
5 18 10 9 4 6 14 7 4 4 6 18 6 5 8 2 12 5 2 4 10 11 5 6 2 6
output:
result:
Test #7:
score: 0
Time Limit Exceeded
input:
5 11 9 5 3 3 12 8 9 9 6 10 10 7 3 9 10 5 4 3 6 6 9 6 4 8
output:
result:
Test #8:
score: 0
Time Limit Exceeded
input:
5 4 5 6 5 10 12 8 5 9 3 10 4 9 9 3 10 5 6 6 3 6 5 7 4 8
output:
result:
Test #9:
score: 0
Time Limit Exceeded
input:
5 11 80 29 27 84 11 31 27 87 6 4 46 54 95 80 6 45 62 88 92 12 70 34 3 75
output:
result:
Test #10:
score: 0
Time Limit Exceeded
input:
5 58 91 37 75 5 62 99 67 10 75 55 51 92 70 85 55 86 16 50 85 29 54 95 36 78
output:
result:
Test #11:
score: 0
Time Limit Exceeded
input:
5 10 57 94 99 18 19 97 77 63 98 62 44 4 90 35 61 3 54 25 60 62 57 65 95 70
output:
result:
Test #12:
score: 0
Time Limit Exceeded
input:
5 5 0 0 9 5 4 0 0 1 5 2 0 0 7 5 3 0 0 3 7 3 0 0 9 5
output:
result:
Test #13:
score: 0
Time Limit Exceeded
input:
5 1931 633 387 65 265 1334 942 887 115 455 1547 511 57 65 920 1815 983 313 575 430 1497 749 773 25 740
output:
result:
Test #14:
score: 0
Time Limit Exceeded
input:
5 1676 347 892 10 545 1552 901 243 595 705 1585 181 32 900 215 1043 147 153 250 195 1343 519 863 610 345
output:
result:
Test #15:
score: 0
Time Limit Exceeded
input:
5 1507 98 480 995 565 1130 476 464 710 925 1556 518 459 65 445 1153 277 530 485 860 1329 191 777 315 905
output:
result:
Test #16:
score: 0
Time Limit Exceeded
input:
5 1260 985 161 855 395 1919 286 557 10 155 1439 586 749 915 730 1297 750 832 245 855 1693 134 289 355 200
output:
result:
Test #17:
score: 0
Time Limit Exceeded
input:
5 95803 976 729 633 237 99669 606 7 489 816 80026 339 914 753 933 97238 844 430 666 537 70169 394 204 411 738
output:
result:
Test #18:
score: 0
Time Limit Exceeded
input:
5 86711 965 851 300 273 97658 466 416 633 603 89583 407 591 411 3 84126 987 514 822 837 79996 9 166 807 15
output:
result:
Test #19:
score: 0
Time Limit Exceeded
input:
5 90325 2 48 195 528 83446 123 809 897 60 92466 526 768 441 447 95582 319 251 843 447 95424 374 218 162 597
output:
result:
Test #20:
score: 0
Time Limit Exceeded
input:
5 80746 952 565 615 192 71949 878 950 357 789 99398 301 646 942 699 94853 670 947 141 276 82409 554 873 375 213