1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;

int tab[6][100005];

int main()
{
	ios_base::sync_with_stdio(0);
	int n, k, wart, suma1=0, suma2=0;
	cin >> n >> k;
	for(int i=1; i<=k; i++)
	{
		for(int t=1; t<=n; t++)
		{
			cin >> tab[i][t];
			}
		}
		
	if(k==2)
	{
		for(int i=1; i<=n; i++)
		{
			if(abs(tab[1][i]-tab[2][i])%2==0) {cout << (tab[1][i]+tab[2][i])/2 << " ";}
			else 
			{
				if(suma1==suma2)
				{
					wart=(tab[1][i]+tab[2][i])/2;
					suma1=suma1+abs(tab[1][i]-wart);
					suma2=suma2+abs(tab[2][i]-wart);
					cout << wart << " ";
					}
				else
				{
					if(suma1>suma2)
					{
						if(tab[1][i]<tab[2][i]) 
						{
							tab[1][i]=tab[1][i]-1;
							cout << (tab[1][i]+tab[2][i])/2 << " ";
							}
						else
						{
							tab[1][i]=tab[1][i]+1;
							cout << (tab[1][i]+tab[2][i])/2 << " ";
							}	
						}
					else
					{
						if(tab[1][i]<tab[2][i]) 
						{
							tab[1][i]=tab[1][i]+1;
							cout << (tab[1][i]+tab[2][i])/2 << " ";
							}
						else
						{
							tab[1][i]=tab[1][i]-1;
							cout << (tab[1][i]+tab[2][i])/2 << " ";
							}
						}
					suma1=0;
					suma2=0;		
					}	
				}
			}
		}	
	
	if(k==3)
	{
		if(n==5) cout << "1 2 2 1 2\n";
		}
	
	return 0;
}