Submission #586361

#TimeUsernameProblemLanguageResultExecution timeMemory
586361krit3379Lightning Rod (NOI18_lightningrod)C++17
66 / 100
2056 ms78900 KiB
#include<bits/stdc++.h> using namespace std; #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") #define N 10000005 struct A{ int x,y; bool operator<(const A& o)const{ if(x!=o.x)return x<o.x; return y>o.y; } }a[N]; int val,ans; int main(){ int n,i,x,y,ma; scanf("%d",&n); for(i=1;i<=n;i++)scanf("%d %d",&x,&y),a[i].x=x-y,a[i].y=x+y; sort(a+1,a+n+1); ma=-1e9; for(i=1;i<=n;i++)if(a[i].y>ma)ans++,ma=a[i].y; printf("%d",ans); return 0; }

Compilation message (stderr)

lightningrod.cpp: In function 'int main()':
lightningrod.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
lightningrod.cpp:20:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |     for(i=1;i<=n;i++)scanf("%d %d",&x,&y),a[i].x=x-y,a[i].y=x+y;
      |                      ~~~~~^~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...