oj.uz

답안 #1119554

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1119554 2024-11-27T06:39:50 Z modwwe 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 14520 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=310;
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<int> s;
int 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(c[a[l]]*v[a[l]]));
        c[a[l]]--;
        s.insert(c[a[l]]*v[a[l]]);
        l++;
    }
    while(l>x)
    {
        l--;
        s.erase(s.find(c[a[l]]*v[a[l]]));
        c[a[l]]++;
        s.insert(c[a[l]]*v[a[l]]);
    }
    while(r<y)
    {
        r++;
        s.erase(s.find(c[a[r]]*v[a[r]]));
        c[a[r]]++;
        s.insert(c[a[r]]*v[a[r]]);
    }
    while(r>y)
    {
        s.erase(s.find(c[a[r]]*v[a[r]]));
        c[a[r]]--;
        s.insert(c[a[r]]*v[a[r]]);
        r--;
    }
}
void phongbeo()
{
    cin>>n>>m;
    for(int i=1; i<=n; i++)
        cin>>a[i],s.insert(0),v.pb(a[i]);
        sort(v.begin(),v.end());
        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:75:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   75 | main()
      | ^~~~
historic.cpp: In function 'void phongbeo()':
historic.cpp:135:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  135 |     for(int i=1; i<=n; i++)
      |     ^~~
historic.cpp:137:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  137 |         sort(v.begin(),v.end());
      |         ^~~~
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 476 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 388 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 2 ms 480 KB Output is correct
13 Correct 1 ms 480 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 476 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 388 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 2 ms 480 KB Output is correct
13 Correct 1 ms 480 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 6 ms 340 KB Output is correct
18 Correct 10 ms 608 KB Output is correct
19 Correct 25 ms 732 KB Output is correct
20 Correct 55 ms 852 KB Output is correct
21 Correct 90 ms 1196 KB Output is correct
22 Correct 95 ms 1180 KB Output is correct
23 Correct 79 ms 1176 KB Output is correct
24 Correct 75 ms 1108 KB Output is correct
25 Correct 90 ms 1188 KB Output is correct
26 Correct 91 ms 1196 KB Output is correct
27 Correct 97 ms 1208 KB Output is correct
28 Correct 105 ms 1136 KB Output is correct
29 Correct 113 ms 1108 KB Output is correct
30 Correct 93 ms 1208 KB Output is correct
31 Correct 88 ms 1108 KB Output is correct
32 Correct 49 ms 1184 KB Output is correct
33 Correct 96 ms 1216 KB Output is correct
34 Correct 95 ms 1240 KB Output is correct
35 Correct 89 ms 1212 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 476 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 10 ms 1408 KB Output is correct
9 Correct 22 ms 2300 KB Output is correct
10 Correct 37 ms 4008 KB Output is correct
11 Correct 141 ms 12248 KB Output is correct
12 Correct 83 ms 8108 KB Output is correct
13 Correct 138 ms 10208 KB Output is correct
14 Correct 134 ms 11708 KB Output is correct
15 Correct 193 ms 14520 KB Output is correct
16 Correct 168 ms 11720 KB Output is correct
17 Correct 94 ms 9428 KB Output is correct
18 Correct 153 ms 12372 KB Output is correct
19 Correct 133 ms 13384 KB Output is correct
20 Correct 71 ms 9920 KB Output is correct

Subtask #4
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 476 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 388 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 2 ms 480 KB Output is correct
13 Correct 1 ms 480 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 6 ms 340 KB Output is correct
18 Correct 10 ms 608 KB Output is correct
19 Correct 25 ms 732 KB Output is correct
20 Correct 55 ms 852 KB Output is correct
21 Correct 90 ms 1196 KB Output is correct
22 Correct 95 ms 1180 KB Output is correct
23 Correct 79 ms 1176 KB Output is correct
24 Correct 75 ms 1108 KB Output is correct
25 Correct 90 ms 1188 KB Output is correct
26 Correct 91 ms 1196 KB Output is correct
27 Correct 97 ms 1208 KB Output is correct
28 Correct 105 ms 1136 KB Output is correct
29 Correct 113 ms 1108 KB Output is correct
30 Correct 93 ms 1208 KB Output is correct
31 Correct 88 ms 1108 KB Output is correct
32 Correct 49 ms 1184 KB Output is correct
33 Correct 96 ms 1216 KB Output is correct
34 Correct 95 ms 1240 KB Output is correct
35 Correct 89 ms 1212 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 476 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 3 ms 596 KB Output is correct
42 Correct 6 ms 852 KB Output is correct
43 Correct 10 ms 1408 KB Output is correct
44 Correct 22 ms 2300 KB Output is correct
45 Correct 37 ms 4008 KB Output is correct
46 Correct 141 ms 12248 KB Output is correct
47 Correct 83 ms 8108 KB Output is correct
48 Correct 138 ms 10208 KB Output is correct
49 Correct 134 ms 11708 KB Output is correct
50 Correct 193 ms 14520 KB Output is correct
51 Correct 168 ms 11720 KB Output is correct
52 Correct 94 ms 9428 KB Output is correct
53 Correct 153 ms 12372 KB Output is correct
54 Correct 133 ms 13384 KB Output is correct
55 Correct 71 ms 9920 KB Output is correct
56 Correct 201 ms 1784 KB Output is correct
57 Correct 551 ms 3008 KB Output is correct
58 Correct 1168 ms 4480 KB Output is correct
59 Correct 1920 ms 5940 KB Output is correct
60 Correct 2730 ms 7156 KB Output is correct
61 Correct 3216 ms 8684 KB Output is correct
62 Correct 3060 ms 10544 KB Output is correct
63 Correct 3440 ms 11620 KB Output is correct
64 Execution timed out 4006 ms 11712 KB Time limit exceeded
65 Halted 0 ms 0 KB -