Codeforces Round #323 A Asphalting Roads
来源:互联网 发布:纺织服装行业协会数据 编辑:程序博客网 时间:2024/06/10 12:30
题意:给你n*n个组数,要在n*n的格子里面,每个交点铺沥青,每组数有两个数值一个为行标一个为列标,问你在这n*n个组数中,在满足所有的行和列都填上要在哪几个工人处铺路,最后将工人按升序输出、
思路:直接标记,如果当前行和列没有被标记那么选择当前工人、最后直接输出便可、
AC代码:
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn = 2510;int vis[maxn];int viz[maxn];int b[maxn];int x,y;int n;int main(){ while(scanf("%d",&n)!=EOF){ memset(vis,0,sizeof(vis)); memset(viz,0,sizeof(viz)); memset(b,0,sizeof(b)); int ans=0; for(int i=0;i<n*n;i++){ scanf("%d %d",&x,&y); if(!vis[x]&&!viz[y]){ vis[x]=1; viz[y]=1; b[ans++]=i+1; } } printf("%d",b[0]); for(int i=1;i<ans;i++) printf(" %d",b[i]); printf("\n"); } return 0;}
0 0
- Codeforces Round #323 A Asphalting Roads
- Codeforces Round #323 (Div. 2) 583A. Asphalting Roads
- Codeforces Round #323 (Div. 2) A. Asphalting Roads
- Codeforces Round #323 (Div. 2) A. Asphalting Roads
- Codeforces Round #323 (Div. 2)A. Asphalting Roads
- Codeforces 583A Asphalting Roads
- codeforces 583A Asphalting Roads
- 【Codeforces Round 323 (Div 2)A】【水题】Asphalting Roads 行列之进行首次操作
- A. Asphalting Roads
- cf#323-div2-A. Asphalting Roads-简单模拟
- Asphalting Roads
- Code Forces 583 A. Asphalting Roads(水~)
- Asphalting Roads [水题]
- codeforces Round#369 div2-D tDirected Roads
- codeforces round#283 A
- Codeforces Round #234A
- Codeforces Round #439 A
- 【Codeforces Round #369 (Div. 2)】Codeforces 711D Directed Roads
- HDU 5492 Find a path(DP)
- 6.Python深入_内存管理
- [汇编语言]在CPU内部,两个寄存器之间通过什么方式进行读写?
- [汇编语言]sub命令得到的结果,在送入内存之前,是否保存在某个寄存器中
- 如何SPM配置
- Codeforces Round #323 A Asphalting Roads
- Codeforces Round #323 B Robot's Task
- C程序调用matlab (Win8 64 bit + VS 2013 + Matlab R2014a)
- Codeforces #323 D. Once Again... (LIS)
- 大家早安,唠叨的兔几出现了,继续话痨python
- 八大排序算法的Python实现
- android自定义view Paint的setMaskFilter(MaskFilter maskfilter)
- SQL多表连接查询
- java定时器