# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1154529 | Otalp | Bulldozer (JOI17_bulldozer) | C++20 | 18 ms | 324 KiB |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define unm unordered_map
#define all(x) (x).begin(), (x).end()
const ll mod = 1e9 + 7;
const int MAXN = 2e5 + 5;
const int MAXA = 2e5 + 5;
pair<pii, int> a[200100];
void solve(){
int n;
cin>>n;
for(int i=1; i<=n; i++){
cin>>a[i].ff.ff>>a[i].ff.ss;
cin>>a[i].ss;
}
ll ans = 0;
for(int i=1; i<=n; i++){
for(int j=i + 1; j<=n; j++){
ll sum = 0;
ll x1 = a[i].ff.ff, y1 = a[i].ff.ss;
ll x2 = a[j].ff.ff, y2 = a[j].ff.ss;
vector<pair<ll, ll> > d, q;
# | 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... |