# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
232989 | shayan_p | Svjetlost (COI18_svjetlost) | C++14 | 1375 ms | 21752 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.
// Never let them see you bleed...
#include<bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n,k) (((n)>>(k))&1)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef long double ld;
const int maxn = 1e5 + 10, mod = 1e9 + 7;
const ld inf = 1e18;
pll p[maxn];
ll operator * (pll a, pll b){
return a.F * b.S - a.S * b.F;
}
ll operator ^ (pll a, pll b){
return a.F * b.F + a.S * b.S;
}
pll operator + (pll a, pll b){
return {a.F + b.F, a.S + b.S};
# | 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... |