# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
970315 | parlimoos | Naan (JOI19_naan) | C++17 | 837 ms | 112048 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.
//Be Name KHODA
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define pp pop_back
#define lb lower_bound
#define ub upper_bound
#define arr(x) array<ll , x>
#define endl '\n'
ll n , l;
ll mat[3000][3000];
vector<arr(2)> pts[3000] , o;
vector<int> ord;
bool use[3000];
bool cmpKsr(arr(2) a , arr(2) b){
ll g = __gcd(a[0] , b[0]);
a[0] /= g , b[0] /= g;
g = __gcd(a[1] , b[1]);
a[1] /= g , b[1] /= g;
return ((a[0] * b[1]) < (a[1] * b[0]));
}
int main(){
ios::sync_with_stdio(0);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |