Submission #337507

#TimeUsernameProblemLanguageResultExecution timeMemory
337507beksultan04Star triangles (IZhO11_triangle)C++14
100 / 100
341 ms10832 KiB
#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)

triangle.cpp:22:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   22 | main(){
      |      ^
triangle.cpp: In function 'int main()':
triangle.cpp:23:13: warning: unused variable 'j' [-Wunused-variable]
   23 |     int n,i,j,ans=0;
      |             ^
triangle.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   11 | #define scan1(a) scanf("%lld",&a);
      |                  ~~~~~^~~~~~~~~~~
triangle.cpp:24:5: note: in expansion of macro 'scan1'
   24 |     scan1(n)
      |     ^~~~~
triangle.cpp:12:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   12 | #define scan2(a,b) scanf("%lld %lld",&a, &b);
      |                    ~~~~~^~~~~~~~~~~~~~~~~~~~
triangle.cpp:27:9: note: in expansion of macro 'scan2'
   27 |         scan2(x[i],y[i])
      |         ^~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...