# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
160489 | jhnah917 | 조화행렬 (KOI18_matrix) | C++14 | 311 ms | 36152 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>
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
struct asdf{
int a, b, c;
asdf(int a = 0, int b = 0, int c = 0) : a(a), b(b), c(c) {}
bool operator < (const asdf &t) const {
if(a != t.a) return a < t.a;
if(b != t.b) return b < t.b;
return c < t.c;
}
};
int k, n;
int arr[4][202020];
vector<asdf> tmp;
vector<p> v;
set<p> st[202020];
int solve(){
int ans = 0;
for(int i=0; i<n; i++){
int l = 1, r = ans + 1;
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... |