-
Notifications
You must be signed in to change notification settings - Fork 184
/
Copy pathb.cc
67 lines (67 loc) · 1.44 KB
/
b.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
// https://codeforces.com/contest/1151/problem/B
#include<bits/stdc++.h>
using namespace std;
using vi=vector<int>;
using vvi=vector<vi>;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n,m;
cin>>n>>m;
vvi a(n,vi(m));
vvi r(n,vi(10));
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)cin>>a[i][j];
for(int k=0;k<10;k++)
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
r[i][k]|=((a[i][j]>>k)&1)?2:1;
for(int k=0;k<10;k++){
int c=0,d=0;
for(int i=0;i<n;i++)
if(r[i][k]==2)c++;
else if(r[i][k]==3)d++;
if(c%2){
vi s;
for(int i=0;i<n;i++){
if(r[i][k]<3){
s.push_back(1);
continue;
}
for(int j=0;j<m;j++)
if(!((a[i][j]>>k)&1)){
s.push_back(j+1);
break;
}
}
cout<<"TAK\n";
for(int i=0;i<n;i++)cout<<s[i]<<" \n"[i==n-1];
return 0;
}else if(d){
vi s;
for(int i=0;i<n;i++){
if(r[i][k]<3){
s.push_back(1);
continue;
}
if(d){
d=0;
for(int j=0;j<m;j++)
if(((a[i][j]>>k)&1)){
s.push_back(j+1);
break;
}
}else
for(int j=0;j<m;j++)
if(!((a[i][j]>>k)&1)){
s.push_back(j+1);
break;
}
}
cout<<"TAK\n";
for(int i=0;i<n;i++)cout<<s[i]<<" \n"[i==n-1];
return 0;
}
}
cout<<"NIE\n";
}