# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
779205 | 1075508020060209tc | NLO (COCI18_nlo) | C++14 | 268 ms | 65536 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;
#define int long long
#define X first
#define Y second
int n;int m;
int Q;
int gr[3010][3010];
signed main(){
cin>>n>>m;
cin>>Q;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
gr[i][j]=1;
}
}
while(Q--){
int x;int y;int r;
cin>>x>>y>>r;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if( ((i-x)*(i-x)+(j-y)*(j-y))<=r*r ){
gr[i][j]=0;
}
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
// cout<<gr[i][j]<<" ";
gr[i][j]++;
}//cout<<endl;
}
//cout<<endl;
}
int ans=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
ans+=gr[i][j]-1;
}
}
cout<<ans<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |