https://codeforces.com/contest/1196/problem/C

題解：思維+交集

/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG #define RI register int #define endl "\n" using namespace std; typedef long long ll; //typedef __int128 lll; const int N=100000+10; const int M=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; int t,n,m,k,p,l,r,u,v; int ans,cnt,flag,temp,sum; int x,y,f[5]; int b[5][2]={0,-1,0,0,1,0,1,0,0,-1}; char str; struct node{}; int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);scanf("%d",&t);while(t--){scanf("%d",&n);int left=-1e5;int right=1e5;int low=-1e5;int high=1e5;for(int i=1;i<=n;i++){scanf("%d%d%d%d%d%d",&x,&y,&f[1],&f[2],&f[3],&f[4]);if(!f[1])left=max(left,x);if(!f[2])high=min(high,y);if(!f[3])right=min(right,x);if(!f[4])low=max(low,y);}if(left<=right&&low<=high){cout<<1<<" "<<left<<" "<<low<<endl;}else{cout<<0<<endl;}}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC); #endif//cout << "Hello world!" << endl;return 0; }

?

總結(jié)

以上是生活随笔為你收集整理的Codeforces 1196C Robot Breakout的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。