oj.uz

답안 #22940

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
22940 2017-04-30T15:12:10 Z dotorya Young Zebra (KRIII5_YZ) C++14
7 / 7
 43 ms 7256 KB 
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#pragma warning(disable:4996)
#pragma comment(linker, "/STACK:336777216")
using namespace std;

#define mp make_pair
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define szz(x) ((int)(x).size())
#define rep(i, n) for(int i=0;i<n;i++)
#define all(x) (x).begin(), (x).end()
#define ldb ldouble

typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <db, db> pdd;

int IT_MAX = 1 << 19;
const ll MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 1034567890123456789ll;
const db PI = acos(-1);
const db ERR = 1E-11;

char in[405][405];
pii dchk[405][405];
int ans[405][405];

int main() {
	int N, M, i, j, k, l;
	scanf("%d %d", &N, &M);
	for (i = 0; i < N; i++) scanf("%s", in[i]);
	
	for (i = 0; i < N; i++) for (j = 0; j < M; j++) dchk[i][j] = pii(INF, INF);
	for (i = 0; i < N; i++) {
		for (j = 0; j < M; j++) {
			if (dchk[i][j].first != INF) continue;

			vector <pii> Vu;
			dchk[i][j] = pii(0, 0);
			Vu.emplace_back(i, j);

			bool tchk = false;
			for (k = 0; k < Vu.size(); k++) {
				for (l = 0; l < 4; l++) {
					int x = (Vu[k].first + "1102"[l] - '1' + N) % N;
					int y = (Vu[k].second + "0211"[l] - '1' + M) % M;
					if (in[x][y] != in[Vu[k].first][Vu[k].second]) continue;

					pii v = dchk[Vu[k].first][Vu[k].second];
					if (Vu[k].second == 0 && l == 0) v.second--;
					if (Vu[k].second == M - 1 && l == 1) v.second++;
					if (Vu[k].first == 0 && l == 2) v.first--;
					if (Vu[k].first == N - 1 && l == 3) v.first++;
					if (dchk[x][y].first != INF && dchk[x][y] != v) tchk = true;
					else if (dchk[x][y].first == INF) {
						dchk[x][y] = v;
						Vu.emplace_back(x, y);
					}
				}
			}
			if (tchk) for (auto it : Vu) ans[it.first][it.second] = -1;
			else for(auto it : Vu) ans[it.first][it.second] = (int)Vu.size();
			Vu.clear();
		}
	}

	for (i = 0; i < N; i++) {
		for (j = 0; j < M; j++) printf("%d ", ans[i][j]);
		printf("\n");
	}
	return 0;
}

Compilation message

YZ.cpp:22:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning(disable:4996)
 ^
YZ.cpp:23:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/STACK:336777216")
 ^
YZ.cpp: In function 'int main()':
YZ.cpp:71:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (k = 0; k < Vu.size(); k++) {
                  ^
YZ.cpp:58:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &N, &M);
                        ^
YZ.cpp:59:44: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (i = 0; i < N; i++) scanf("%s", in[i]);
                                            ^

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 7256 KB Output is correct
2 Correct 29 ms 5720 KB Output is correct
3 Correct 26 ms 5720 KB Output is correct
4 Correct 29 ms 5204 KB Output is correct
5 Correct 26 ms 5200 KB Output is correct
6 Correct 33 ms 4692 KB Output is correct
7 Correct 26 ms 6228 KB Output is correct
8 Correct 29 ms 6228 KB Output is correct
9 Correct 26 ms 6228 KB Output is correct
10 Correct 23 ms 6228 KB Output is correct
11 Correct 26 ms 7256 KB Output is correct
12 Correct 33 ms 7256 KB Output is correct
13 Correct 36 ms 6224 KB Output is correct
14 Correct 29 ms 6228 KB Output is correct
15 Correct 33 ms 6228 KB Output is correct
16 Correct 26 ms 6228 KB Output is correct
17 Correct 26 ms 6224 KB Output is correct
18 Correct 33 ms 5720 KB Output is correct
19 Correct 36 ms 4100 KB Output is correct
20 Correct 26 ms 5720 KB Output is correct
21 Correct 29 ms 5720 KB Output is correct
22 Correct 19 ms 6228 KB Output is correct
23 Correct 43 ms 5720 KB Output is correct
24 Correct 33 ms 5720 KB Output is correct
25 Correct 29 ms 4952 KB Output is correct
26 Correct 0 ms 4100 KB Output is correct
27 Correct 0 ms 4100 KB Output is correct
28 Correct 0 ms 4240 KB Output is correct
29 Correct 0 ms 4240 KB Output is correct
30 Correct 0 ms 4100 KB Output is correct
31 Correct 0 ms 4100 KB Output is correct
32 Correct 0 ms 4100 KB Output is correct
33 Correct 0 ms 4100 KB Output is correct
34 Correct 0 ms 4100 KB Output is correct
35 Correct 0 ms 4100 KB Output is correct
36 Correct 0 ms 4372 KB Output is correct
37 Correct 0 ms 4372 KB Output is correct
38 Correct 3 ms 4100 KB Output is correct
39 Correct 3 ms 4372 KB Output is correct
40 Correct 0 ms 4372 KB Output is correct