1、http://codeforces.com/contest/411/problem/B
2、题目大意：
有n条指令，m次循环，k块内存，n个CPU，每一次循环n个CPU各执行一条指令，接到指令就立刻执行，相当于n条指令在同一次循环中一起执行，如果有超过一条指令同时申请同一块内存，那么执行这条指令的CPU和将要申请的内存都会被锁住，如果有一条指令申请一块已经被锁住的内存也将会被锁住，输出每条指令在第几次循环中被锁住，如果没被锁住，输出0
3、题目：
The research center Q has developed a new multi-core processor. The processor consists of n cores and has k cells of cache memory. Consider the work of this processor.
At each cycle each core of the processor gets one instruction: either do nothing, or the number of the memory cell (the core will write an information to the cell). After receiving the command, the core executes it immediately. Sometimes it happens that at one cycle, multiple cores try to write the information into a single cell. Unfortunately, the developers did not foresee the possibility of resolving conflicts between cores, so in this case there is a deadlock: all these cores and the corresponding memory cell are locked forever. Each of the locked cores ignores all further commands, and no core in the future will be able to record an information into the locked cell. If any of the cores tries to write an information into some locked cell, it is immediately locked.
The development team wants to explore the deadlock situation. Therefore, they need a program that will simulate the processor for a given set of instructions for each core within m cycles . You're lucky, this interesting work is entrusted to you. According to the instructions, during the m cycles define for each core the number of the cycle, during which it will become locked. It is believed that initially all cores and all memory cells are not locked.
The first line contains three integers n, m, k (1?≤?n,?m,?k?≤?100). Then follow n lines describing instructions. The i-th line contains m integers: xi1,?xi2,?...,?xim (0?≤?xij?≤?k), where xij is the instruction that must be executed by the i-th core at the j-th cycle. If xij equals 0, then the corresponding instruction is ?do nothing?. But if xij is a number from 1 to k, then the corresponding instruction is ?write information to the memory cell number xij?.
We assume that the cores are numbered from 1 to n, the work cycles are numbered from 1 to m and the memory cells are numbered from 1 to k.
Print n lines. In the i-th line print integer ti. This number should be equal to 0 if the i-th core won't be locked, or it should be equal to the number of the cycle when this core will be locked.
4 3 5 1 0 0 1 0 2 2 3 1 3 2 0
1 1 3 0
3 2 2 1 2 1 2 2 2
1 1 0
1 1 1 0
0
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{int n,m,k;int x[105][105];int a[105];//内存int flag[105];int cnt[105];while(scanf("%d%d%d",&n,&m,&k)!=EOF){for(int i=1;i<=n;i++){for(int j=1;j<=m;j++){scanf("%d",&x[i][j]);}}memset(a,0,sizeof(a));memset(flag,0,sizeof(flag));for(int j=1;j<=m;j++){memset(cnt,0,sizeof(cnt));for(int i=1;i<=n;i++){if(flag[i]==0){cnt[x[i][j]]++;}}for(int i=1;i<=n;i++){if(x[i][j]==0)continue;if(flag[i]==0){if(cnt[x[i][j]]>1){a[x[i][j]]=-1;flag[i]=j;}if(a[x[i][j]]==-1){flag[i]=j;}}}}for(int i=1;i<=n;i++){printf("%d\n",flag[i]);}}return 0;
}
/*
4 3 5
1 0 0
0 0 0
0 0 0
0 0 0
*/