oj.uz

Submission #1119562

# Submission time Handle Problem Language Result Execution time Memory
1119562 2024-11-27T06:43:50 Z modwwe 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 8880 KB 
#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=316;
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()
{
    cin>>n>>m;
    for(int i=1; i<=n; i++)
        cin>>a[i],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++)
    {
        cin>>l>>r;
        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

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:139:14: warning: unused variable 'x' [-Wunused-variable]
  139 |     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);
      |         ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 2 ms 336 KB Output is correct
17 Correct 4 ms 336 KB Output is correct
18 Correct 8 ms 336 KB Output is correct
19 Correct 18 ms 560 KB Output is correct
20 Correct 40 ms 632 KB Output is correct
21 Correct 66 ms 592 KB Output is correct
22 Correct 75 ms 732 KB Output is correct
23 Correct 50 ms 712 KB Output is correct
24 Correct 55 ms 716 KB Output is correct
25 Correct 77 ms 792 KB Output is correct
26 Correct 74 ms 912 KB Output is correct
27 Correct 80 ms 776 KB Output is correct
28 Correct 80 ms 592 KB Output is correct
29 Correct 90 ms 752 KB Output is correct
30 Correct 77 ms 592 KB Output is correct
31 Correct 57 ms 592 KB Output is correct
32 Correct 24 ms 592 KB Output is correct
33 Correct 76 ms 760 KB Output is correct
34 Correct 82 ms 808 KB Output is correct
35 Correct 77 ms 840 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 2 ms 336 KB Output is correct
6 Correct 4 ms 336 KB Output is correct
7 Correct 7 ms 592 KB Output is correct
8 Correct 7 ms 592 KB Output is correct
9 Correct 20 ms 1040 KB Output is correct
10 Correct 10 ms 1000 KB Output is correct
11 Correct 69 ms 4512 KB Output is correct
12 Correct 41 ms 1236 KB Output is correct
13 Correct 104 ms 2548 KB Output is correct
14 Correct 129 ms 5156 KB Output is correct
15 Correct 157 ms 7232 KB Output is correct
16 Correct 135 ms 8004 KB Output is correct
17 Correct 45 ms 2280 KB Output is correct
18 Correct 81 ms 3716 KB Output is correct
19 Correct 127 ms 8880 KB Output is correct
20 Correct 81 ms 7112 KB Output is correct

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 2 ms 336 KB Output is correct
17 Correct 4 ms 336 KB Output is correct
18 Correct 8 ms 336 KB Output is correct
19 Correct 18 ms 560 KB Output is correct
20 Correct 40 ms 632 KB Output is correct
21 Correct 66 ms 592 KB Output is correct
22 Correct 75 ms 732 KB Output is correct
23 Correct 50 ms 712 KB Output is correct
24 Correct 55 ms 716 KB Output is correct
25 Correct 77 ms 792 KB Output is correct
26 Correct 74 ms 912 KB Output is correct
27 Correct 80 ms 776 KB Output is correct
28 Correct 80 ms 592 KB Output is correct
29 Correct 90 ms 752 KB Output is correct
30 Correct 77 ms 592 KB Output is correct
31 Correct 57 ms 592 KB Output is correct
32 Correct 24 ms 592 KB Output is correct
33 Correct 76 ms 760 KB Output is correct
34 Correct 82 ms 808 KB Output is correct
35 Correct 77 ms 840 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 2 ms 336 KB Output is correct
40 Correct 2 ms 336 KB Output is correct
41 Correct 4 ms 336 KB Output is correct
42 Correct 7 ms 592 KB Output is correct
43 Correct 7 ms 592 KB Output is correct
44 Correct 20 ms 1040 KB Output is correct
45 Correct 10 ms 1000 KB Output is correct
46 Correct 69 ms 4512 KB Output is correct
47 Correct 41 ms 1236 KB Output is correct
48 Correct 104 ms 2548 KB Output is correct
49 Correct 129 ms 5156 KB Output is correct
50 Correct 157 ms 7232 KB Output is correct
51 Correct 135 ms 8004 KB Output is correct
52 Correct 45 ms 2280 KB Output is correct
53 Correct 81 ms 3716 KB Output is correct
54 Correct 127 ms 8880 KB Output is correct
55 Correct 81 ms 7112 KB Output is correct
56 Correct 121 ms 944 KB Output is correct
57 Correct 433 ms 1276 KB Output is correct
58 Correct 885 ms 1924 KB Output is correct
59 Correct 1633 ms 2580 KB Output is correct
60 Correct 2542 ms 3012 KB Output is correct
61 Correct 2669 ms 3004 KB Output is correct
62 Correct 2182 ms 3960 KB Output is correct
63 Correct 1658 ms 3900 KB Output is correct
64 Correct 1018 ms 4348 KB Output is correct
65 Correct 648 ms 6352 KB Output is correct
66 Correct 1478 ms 6468 KB Output is correct
67 Correct 3284 ms 6468 KB Output is correct
68 Execution timed out 4011 ms 5756 KB Time limit exceeded
69 Halted 0 ms 0 KB -