oj.uz

답안 #1119567

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1119567 2024-11-27T06:45:59 Z modwwe 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 9604 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=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

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);
      |         ^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 512 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 2 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 512 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 2 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 508 KB Output is correct
17 Correct 4 ms 336 KB Output is correct
18 Correct 9 ms 336 KB Output is correct
19 Correct 18 ms 588 KB Output is correct
20 Correct 40 ms 672 KB Output is correct
21 Correct 70 ms 592 KB Output is correct
22 Correct 74 ms 732 KB Output is correct
23 Correct 45 ms 720 KB Output is correct
24 Correct 47 ms 612 KB Output is correct
25 Correct 75 ms 792 KB Output is correct
26 Correct 83 ms 592 KB Output is correct
27 Correct 74 ms 776 KB Output is correct
28 Correct 84 ms 592 KB Output is correct
29 Correct 75 ms 840 KB Output is correct
30 Correct 83 ms 760 KB Output is correct
31 Correct 55 ms 592 KB Output is correct
32 Correct 28 ms 728 KB Output is correct
33 Correct 74 ms 756 KB Output is correct
34 Correct 90 ms 848 KB Output is correct
35 Correct 75 ms 808 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 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 508 KB Output is correct
5 Correct 3 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 6 ms 592 KB Output is correct
8 Correct 8 ms 592 KB Output is correct
9 Correct 16 ms 1252 KB Output is correct
10 Correct 7 ms 980 KB Output is correct
11 Correct 71 ms 3716 KB Output is correct
12 Correct 44 ms 1232 KB Output is correct
13 Correct 88 ms 2356 KB Output is correct
14 Correct 99 ms 5084 KB Output is correct
15 Correct 139 ms 8512 KB Output is correct
16 Correct 151 ms 8712 KB Output is correct
17 Correct 36 ms 2900 KB Output is correct
18 Correct 61 ms 3648 KB Output is correct
19 Correct 102 ms 9604 KB Output is correct
20 Correct 57 ms 7880 KB Output is correct

Subtask #4
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 512 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 2 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 508 KB Output is correct
17 Correct 4 ms 336 KB Output is correct
18 Correct 9 ms 336 KB Output is correct
19 Correct 18 ms 588 KB Output is correct
20 Correct 40 ms 672 KB Output is correct
21 Correct 70 ms 592 KB Output is correct
22 Correct 74 ms 732 KB Output is correct
23 Correct 45 ms 720 KB Output is correct
24 Correct 47 ms 612 KB Output is correct
25 Correct 75 ms 792 KB Output is correct
26 Correct 83 ms 592 KB Output is correct
27 Correct 74 ms 776 KB Output is correct
28 Correct 84 ms 592 KB Output is correct
29 Correct 75 ms 840 KB Output is correct
30 Correct 83 ms 760 KB Output is correct
31 Correct 55 ms 592 KB Output is correct
32 Correct 28 ms 728 KB Output is correct
33 Correct 74 ms 756 KB Output is correct
34 Correct 90 ms 848 KB Output is correct
35 Correct 75 ms 808 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 508 KB Output is correct
40 Correct 3 ms 336 KB Output is correct
41 Correct 2 ms 336 KB Output is correct
42 Correct 6 ms 592 KB Output is correct
43 Correct 8 ms 592 KB Output is correct
44 Correct 16 ms 1252 KB Output is correct
45 Correct 7 ms 980 KB Output is correct
46 Correct 71 ms 3716 KB Output is correct
47 Correct 44 ms 1232 KB Output is correct
48 Correct 88 ms 2356 KB Output is correct
49 Correct 99 ms 5084 KB Output is correct
50 Correct 139 ms 8512 KB Output is correct
51 Correct 151 ms 8712 KB Output is correct
52 Correct 36 ms 2900 KB Output is correct
53 Correct 61 ms 3648 KB Output is correct
54 Correct 102 ms 9604 KB Output is correct
55 Correct 57 ms 7880 KB Output is correct
56 Correct 134 ms 936 KB Output is correct
57 Correct 432 ms 1400 KB Output is correct
58 Correct 875 ms 1924 KB Output is correct
59 Correct 1651 ms 2564 KB Output is correct
60 Correct 2507 ms 3204 KB Output is correct
61 Correct 2452 ms 3004 KB Output is correct
62 Correct 2207 ms 3580 KB Output is correct
63 Correct 1647 ms 4080 KB Output is correct
64 Correct 1014 ms 4344 KB Output is correct
65 Correct 689 ms 4416 KB Output is correct
66 Correct 1459 ms 4672 KB Output is correct
67 Correct 3220 ms 4632 KB Output is correct
68 Execution timed out 4046 ms 3904 KB Time limit exceeded
69 Halted 0 ms 0 KB -