제출 #9781

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
9781	2014-09-28 08:54:38	myungwoo	Solve another chuck (kriii2_S)	C++14	0 / 4	0 ms	1252 KiB

S

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
#include <stdio.h>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
int N, M, K, C, all, zeros, X = 2e9;
bool V[10001];
vector <int> arr;
int main()
{
  int i, j, k;
  scanf("%d%d", &N, &M); K = N*M;
  for (i=1;i<=K;i++){
    scanf("%d", &k);
    if (k < 0) C++, k = -k;
    if (k) arr.push_back(k);
    else zeros++;
    all += k;
  }
  sort(arr.begin(), arr.end());
  queue <int> que;
  V[C] = 1; que.push(C);
  while (!que.empty()){
    int q = que.front(); que.pop();
    if (q >= N){
      if (!V[q-N]) V[q-N] = 1, que.push(q-N);
    }
    else{
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 4