# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
26576 | kajebiii | Young Zebra (KRIII5_YZ) | C++14 | 56 ms | 10020 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
·#include <stdio.h>
#include <algorithm>
#include <vector>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <tuple>
#include <string.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
typedef long long ll;
typedef pair<int, int> pi;
const int MAX_N = 4e2 + 10;
int N, M;
char Mp[MAX_N*3][MAX_N*3];
int Chk[MAX_N][MAX_N];
pi Last[MAX_N][MAX_N];
bool Vis[MAX_N*3][MAX_N*3];
int main() {
scanf("%d%d", &N, &M);
for(int i=0; i<N; i++) scanf("%s", Mp[i]);
for(int i=0; i<3*N; i++) for(int j=0; j<3*M; j++) Mp[i][j] = Mp[i%N][j%M];
for(int x=0; x<N; x++) for(int y=0; y<M; y++) {
if(Chk[x][y] != 0) continue;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |