# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
96316 | kraljlavova1 | NLO (COCI18_nlo) | C++11 | 354 ms | 66560 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 long long int ll;
typedef pair<int, int> pii;
const int MAX = 1e5 + 10;
struct seg{
int s;
int e;
int t;
};
int n, m;
int k;
vector<seg> ls[MAX];
ll sol, sum, lsum;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
cin >> n >> m;
cin >> k;
for(int i = 1;i <= n; i++){
ls[i].push_back({1, m, 0});
}
for(int i = 1;i <= k; i++){
int x, y, r;
cin >> x >> y >> r;
for(int j = x - r;j <= x + r; j++){
ll tmp = r * r - (j - x) * (j - x), ntmp;
tmp = sqrt(tmp);
ntmp = -tmp;
ls[j].push_back({(int)ntmp + y, (int)tmp + y, i});
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |