Pagini recente » Cod sursa (job #3176480) | Cod sursa (job #538784) | Cod sursa (job #2256638) | Cod sursa (job #721193) | Cod sursa (job #2516387)
#include <bits/stdc++.h>
#define ll long long
#define all(a) (a).begin(), (a).end()
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in insert
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
//#define mp make_pair
#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
using namespace std;
const int mod=1e9+7;
const int modx=998244353;
const int per=666013;
int n,par[2][2];
pair<int,int>a[1005];
bool check(){
for(int i=1;i<=n;i++){
if(a[i].fr%2==0) goto Next;
}
for(int i=1;i<=n;i++) a[i].fr--;
Next:
for(int i=1;i<=n;i++){
if(a[i].sc%2==0) goto Next1;
}
for(int i=1;i<=n;i++) a[i].sc--;
Next1:
for(int i=1;i<=n;i++){
if(abs(a[i].fr%2)==1 || abs(a[i].sc%2)==1) return false;
}
return true;
}
int32_t main(){
ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
srand(chrono::steady_clock::now().time_since_epoch().count());
cin >> n;
for(int i=1;i<=n;i++) cin >> a[i].fr >> a[i].sc;
while(check()==true){
for(int i=1;i<=n;i++) a[i].fr/=2,a[i].sc/=2;
}
for(int i=1;i<=n;i++){
if(abs(a[i].fr%2)==1 && a[i].sc%2==0) par[1][0]++;
else if(abs(a[i].fr%2)==1 && abs(a[i].sc%2)==1) par[1][1]++;
else if(a[i].fr%2==0 && a[i].sc%2==0) par[0][0]++;
else par[0][1]++;
}
// cout << par[0][0] << ' ' << par[0][1] << ' ' << par[1][0] << ' ' << par[1][1] << '\n';
if(par[1][0]+par[0][1]>=1 && par[0][0]+par[1][1]>=1){
vector<int>ans;
for(int i=1;i<=n;i++) if(abs(a[i].fr%2)==abs(a[i].sc%2)) ans.push_back(i);
cout << ans.size() << '\n';
for(auto i:ans) cout << i << ' ';
return 0;
}
else{
if(par[0][0]+par[1][1]>=1){
vector<int>ans;
for(int i=1;i<=n;i++){
if(a[i].fr%2==0 && a[i].sc%2==0) ans.push_back(i);
}
cout << ans.size() << '\n';
for(auto i:ans) cout << i << ' ';
return 0;
}
else{
vector<int>ans;
for(int i=1;i<=n;i++){
if(abs(a[i].fr%2)==1 && a[i].sc%2==0) ans.push_back(i);
}
cout << ans.size() << '\n';
for(auto i:ans) cout << i << ' ';
return 0;
}
}
}