# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
117171 | onjo0127 | 영역 (JOI16_ho_t4) | C++11 | 1085 ms | 148224 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 <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
set<pii> st;
char S[100009];
int cnt(set<pii> S) {
int ret = 0;
for(auto& it: S) {
int x, y; tie(x, y) = it;
if(S.find({x+1, y}) != S.end() && S.find({x, y+1}) != S.end() && S.find({x+1, y+1}) != S.end()) ++ret;
}
return ret;
}
set<pii> rep(set<pii>& S, int K, int dx, int dy) {
set<pii> ret;
for(int i=0; i<K; i++) {
for(auto& it: S) {
int x, y; tie(x, y) = it;
ret.insert({x + dx*i, y + dy*i});
}
}
return ret;
}
int main() {
int N, K; scanf("%d%d",&N,&K);
int x = 0, y = 0; st.insert({0, 0});
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |