# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
337507 | beksultan04 | Star triangles (IZhO11_triangle) | C++14 | 341 ms | 10832 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 pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 1e6+12,INF=1e9+7;
int dp[N],x[N],y[N];
main(){
int n,i,j,ans=0;
scan1(n)
vector <int> a,b;
for (i=0;i<n;++i){
scan2(x[i],y[i])
a.pb(x[i]);
b.pb(y[i]);
}
sort(all(a));
sort(all(b));
for (i=0;i<n;++i){
int l1 = lower_bound(all(a),x[i])-a.begin();
int r1 = upper_bound(all(a),x[i])-a.begin()-1;
int l2 = lower_bound(all(b),y[i])-b.begin();
int r2 = upper_bound(all(b),y[i])-b.begin()-1;
ans += (r2-l2)*(r1-l1);
}
cout <<ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |