# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
337507 | 2020-12-21T02:53:38 Z | beksultan04 | 별들과 삼각형 (IZhO11_triangle) | C++14 | 341 ms | 10832 KB |
#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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
4 | Correct | 0 ms | 364 KB | Output is correct |
5 | Correct | 0 ms | 364 KB | Output is correct |
6 | Correct | 1 ms | 364 KB | Output is correct |
7 | Correct | 1 ms | 364 KB | Output is correct |
8 | Correct | 1 ms | 364 KB | Output is correct |
9 | Correct | 1 ms | 364 KB | Output is correct |
10 | Correct | 1 ms | 364 KB | Output is correct |
11 | Correct | 1 ms | 364 KB | Output is correct |
12 | Correct | 7 ms | 748 KB | Output is correct |
13 | Correct | 6 ms | 748 KB | Output is correct |
14 | Correct | 9 ms | 748 KB | Output is correct |
15 | Correct | 100 ms | 3672 KB | Output is correct |
16 | Correct | 118 ms | 3928 KB | Output is correct |
17 | Correct | 100 ms | 3692 KB | Output is correct |
18 | Correct | 99 ms | 3672 KB | Output is correct |
19 | Correct | 309 ms | 10832 KB | Output is correct |
20 | Correct | 212 ms | 6864 KB | Output is correct |
21 | Correct | 339 ms | 10832 KB | Output is correct |
22 | Correct | 341 ms | 10832 KB | Output is correct |