Submission #1119567

#TimeUsernameProblemLanguageResultExecution timeMemory
1119567modwwe역사적 조사 (JOI14_historical)C++17
40 / 100
4046 ms9604 KiB
#pragma GCC optimize("Ofast,unroll-loops") //#pragma GCC optimize("conserve-stack") #include<bits/stdc++.h> //#define int long long #define ll long long #define down cout<<'\n'; #define debug cout<<" cucuucucuuu",down #define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0); #define modwwe int t;cin>>t; while(t--) #define bit(i,j) (i>>j&1) #define sobit(a) __builtin_popcountll(a) #define task "test" #define fin(x) freopen(x".inp","r",stdin) #define fou(x) freopen(x".out","w",stdout) #define pb push_back #define mask(k) (1<<k) #define mp make_pair #define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms"; using namespace std; #define getchar_unlocked getchar inline int scan() { char c = getchar_unlocked(); int x = 0; while (c < '0' || c > '9') { c = getchar_unlocked(); } while (c >= '0' && c <= '9') { x = (x << 1) + (x << 3) + c - '0'; c = getchar_unlocked(); } return x; } void phongbeo(); const int inf = 1e10; const ll mod2 = 1e9 + 7; const int mod1 = 998244353; const ll base=67; int add(int x,int y) { if(x+y>=mod2) x-=mod2; if(x+y<0)x+=mod2; return x+y; } struct icd { long double a; int b; }; struct ib { int a; int b; }; struct ic { int a, b, c; }; struct id { int a, b, c, d; }; struct ie { int a, b, c, d, e; }; int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center; int i, s10, s12,k1,k2,k3,s11,t,lim,w,l,r ; int kk; int el = 19; main() { if(fopen(task".inp","r")) { fin(task); fou(task); } NHP /// cin>>s1; // modwwe phongbeo(); // checktime } int S=315; bool cmp(ic a,ic b) { if(a.a / S != b.a / S) return (a.a < b.a); else if(!((a.a / S) & 1)) return (a.b < b.b); else return (a.b > b.b); } multiset<ll> s; ll ans[100001]; int a[100001]; vector<int> v; vector<ic> v2; int c[100001]; void go(int x,int y) { while(l<x) { s.erase(s.find(1ll*c[a[l]]*v[a[l]])); c[a[l]]--; s.insert(1ll*c[a[l]]*v[a[l]]); l++; } while(l>x) { l--; s.erase(s.find(1ll*c[a[l]]*v[a[l]])); c[a[l]]++; s.insert(1ll*c[a[l]]*v[a[l]]); } while(r<y) { r++; s.erase(s.find(1ll*c[a[r]]*v[a[r]])); c[a[r]]++; s.insert(1ll*c[a[r]]*v[a[r]]); } while(r>y) { s.erase(s.find(1ll*c[a[r]]*v[a[r]])); c[a[r]]--; s.insert(1ll*c[a[r]]*v[a[r]]); r--; } } void phongbeo() { n=scan(); m=scan(); for(int i=1; i<=n; i++) a[i]=scan(),v.pb(a[i]); sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); for(auto x:v) s.insert(0); for(int i=1; i<=n; i++) a[i]=lower_bound(v.begin(),v.end(),a[i])-v.begin(); for(int i=1; i<=m; i++) { l=scan(); r=scan(); v2.pb({l,r,i}); } sort(v2.begin(),v2.end(),cmp); l=1; r=0; for(auto x:v2) { go(x.a,x.b); ans[x.c]=*s.rbegin(); } for(int i=1; i<=m; i++) cout<<ans[i],down }

Compilation message (stderr)

historic.cpp:38:17: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+10' to '2147483647' [-Woverflow]
   38 | const int inf = 1e10;
      |                 ^~~~
historic.cpp:75:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   75 | main()
      | ^~~~
historic.cpp: In function 'void phongbeo()':
historic.cpp:140:14: warning: unused variable 'x' [-Wunused-variable]
  140 |     for(auto x:v)
      |              ^
historic.cpp: In function 'int main()':
historic.cpp:13:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
historic.cpp:79:9: note: in expansion of macro 'fin'
   79 |         fin(task);
      |         ^~~
historic.cpp:14:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 | #define fou(x) freopen(x".out","w",stdout)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
historic.cpp:80:9: note: in expansion of macro 'fou'
   80 |         fou(task);
      |         ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...