# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
319121 | egod1537 | 매트 (KOI15_mat) | C++14 | 1097 ms | 110372 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>
#include <unordered_map>
using namespace std;
struct Mat {
int x1, y1, x2, y2, cost;
};
bool isCol(Mat& m1, Mat& m2) {
if (m1.x2 <= m2.x1 || m2.x2 <= m1.x1) return false;
if (m1.y2 <= m2.y1 || m2.y2 <= m1.y1) return false;
return true;
}
//i, j번째 매트가 겹치는지
bool col[3001][3001];
//i번재 매트가 x_j 이하에 있는지
bool least[3001][6001];
int n, w;
vector<int> sx;
unordered_map<int, int> xidx;
int dp[3001][6001];
int cache[3001][6001];
vector<Mat> arr;
int main() {
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |