# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
410163 | egod1537 | 조화행렬 (KOI18_matrix) | C++14 | 261 ms | 28092 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;
typedef pair<int, int> pi;
struct Tuple {
int a, b, c;
};
bool operator<(const Tuple& t1, const Tuple& t2) {
if (t1.a != t2.a) return t1.a < t2.a;
if (t1.b != t2.b) return t1.b < t2.b;
return t1.c < t2.c;
}
vector<Tuple> arr;
int maxlis = 0;
int dp[200001];
//lis 그래프
struct Graph {
set<pi> g[200001];
void insert(int k, pi p) {
auto pos = g[k].lower_bound(p);
//prev가 없을 때
if (pos == g[k].begin()) pos = (g[k].insert(p)).first;
else {
auto back = prev(pos);
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... |