Codeforces 1196E Connected Component on a Chessboard

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

题解：贪心

/*
*@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 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--){int b,w;cin>>b>>w;if(b>3*w+1||w>3*b+1){cout<<"NO"<<"\n";}else {cout<<"YES"<<endl;int x = min(b,w);for(int i=0;i<2*x;i++){printf("%d %d\n",2,i+2);}b-=x;w-=x;for(int i=0;i<w;i++){if(i<x)printf("%d %d\n",1,2*i+3);else if(i<2*x)printf("%d %d\n",3,2*i+3-2*x);else printf("2 %d\n",2*x+2);}for(int i=0;i<b;i++){if(i<x)printf("%d %d\n",1,2*i+2);else if(i<2*x)printf("%d %d\n",3,2*i+2-2*x);else printf("2 1\n");}}}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif//cout << "Hello world!" << endl;return 0;
}

Codeforces 1196E Connected Component on a Chessboard相关推荐

C++实现connected component连通分量(附完整源码)
C++实现connected component连通分量 C++实现connected component连通分量完整源码(定义,实现,main函数测试) C++实现connected compone ...
C++用并查集Disjoint union实现connected component连通分量(附完整源码)
C++用并查集Disjoint union实现connected component连通分量 C++用并查集Disjoint union实现connected component连通分量完整源码(定义 ...
LintCode Find the Weak Connected Component in the Directed Graph
原题链接在这里:http://www.lintcode.com/en/problem/find-the-weak-connected-component-in-the-directed-graph/ ...
翻译|How to Export a Connected Component
原文在这里:How to Export a Connected Component 根据你在export的不同,可以获得一个完美的函数式React-Redux connected组件,或者是一个完全忽 ...
Connected component
活动地址:CSDN21天学习挑战赛 Undirected Graph An Undirected graph is connected if, for every pair nodes, th ...
【CodeForces - 1027B 】Numbers on the Chessboard （没有营养的找规律题，无聊题）
题干: You are given a chessboard of size n×nn×n. It is filled with numbers from 11 to n2n2 in the foll ...
codeforces 1027 B - Numbers on the Chessboard（规律）
给一个n*n的数字矩阵然后1到n^2/2的就从左到右从上到下依次放在行列加起来是偶数的格子里然后n^2/2+1的就放在奇数格子里然后询问某个格子的数是多少其实就是根据n是奇数还是偶数还有询 ...
基础算法 —— 模拟思维
[概述] 模拟,是根据实际问题建立模型,模拟实际按程序走一遍,最终求出答案. 思维,则是与逻辑思维有关,其需要针对题意.数据范围等抽丝剥茧抽离出有用的信息,从而得出一个结果. 对于一般的模拟,直接根据 ...
【CodeForces - 920E】Connected Components? （dsu，补图连通块，STLset+map，bfs 或bitset）
题干: You are given an undirected graph consisting of n vertices and edges. Instead of giving you the ...

Codeforces 1196E Connected Component on a Chessboard

Codeforces 1196E Connected Component on a Chessboard相关推荐

最新文章

热门文章