oj.uz

Submission #24874

# Submission time Handle Problem Language Result Execution time Memory
24874 2017-06-16T14:43:19 Z evenharder 역사적 조사 (JOI14_historical) C++11
40 / 100
 4000 ms 15560 KB 
#include <cstdio>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
#include <utility>
#include <cmath>
#include <functional>

struct query{
    int l,r,n;
    long long int ans;
    query(int l=0, int r=0, int n=0) : l(l), r(r), n(n) {ans=0LL;}
};

std::map<int, long long int> m; // amount
std::multiset<long long int, std::greater<long long int> > s;
std::vector<query> vq;
const int MAX_N=100000;
int x[MAX_N+1];
int n,q;
void calc()
{
    int sq=(int)(ceil(sqrt(n+1)));
    std::sort(vq.begin(), vq.end(), [&] (query A, query B) {
        return A.l/sq == B.l/sq ? A.r < B.r : A.l < B.l;
    });

    int l=1;
    int r=0;
    for(int i=0;i<n;i++) s.insert(0);

    for(int i=0;i<q;i++)
    {
        while(r<vq[i].r)
        {
            r++;
            long long int prev = m[x[r]] * x[r];
            auto it = s.find(prev);
            s.erase(it);
            m[x[r]]++;
            s.insert(prev+x[r]);
        }
        while(r>vq[i].r)
        {
            long long int prev = m[x[r]] * x[r];
            auto it = s.find(prev);
            s.erase(it);
            m[x[r]]--;
            s.insert(prev-x[r]);
            r--;
        }
        while(l<vq[i].l)
        {
            long long int prev = m[x[l]] * x[l];
            auto it = s.find(prev);
            s.erase(it);
            m[x[l]]--;
            s.insert(prev-x[l]);
            l++;
        }
        while(l>vq[i].l)
        {
            l--;
            long long int prev = m[x[l]] * x[l];
            auto it = s.find(prev);
            s.erase(it);
            m[x[l]]++;
            s.insert(prev+x[l]);
        }
        vq[i].ans=*s.begin();
    }

    std::sort(vq.begin(), vq.end(), [&] (query A, query B) {
        return A.n < B.n;
    });

    for(int i=0;i<q;i++) printf("%lld\n", vq[i].ans);
}
int main()
{

    scanf("%d%d",&n,&q);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&x[i]);
    }
    for(int i=0;i<q;i++)
    {
        static int l,r;
        scanf("%d%d",&l,&r);
        vq.push_back(query(l,r,i));
    }

    calc();
}

Compilation message

historic.cpp: In function 'int main()':
historic.cpp:83:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&q);
                        ^
historic.cpp:86:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&x[i]);
                          ^
historic.cpp:91:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&l,&r);
                            ^

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1584 KB Output is correct
2 Correct 3 ms 1584 KB Output is correct
3 Correct 9 ms 1716 KB Output is correct
4 Correct 26 ms 1756 KB Output is correct
5 Correct 79 ms 1888 KB Output is correct
6 Correct 159 ms 1988 KB Output is correct
7 Correct 179 ms 1988 KB Output is correct
8 Correct 119 ms 1988 KB Output is correct
9 Correct 129 ms 1988 KB Output is correct
10 Correct 249 ms 2120 KB Output is correct
11 Correct 243 ms 2120 KB Output is correct
12 Correct 269 ms 2120 KB Output is correct
13 Correct 239 ms 2120 KB Output is correct
14 Correct 226 ms 2120 KB Output is correct
15 Correct 229 ms 2120 KB Output is correct
16 Correct 136 ms 1988 KB Output is correct
17 Correct 56 ms 1988 KB Output is correct
18 Correct 209 ms 2120 KB Output is correct
19 Correct 276 ms 2120 KB Output is correct
20 Correct 276 ms 2120 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1584 KB Output is correct
2 Correct 0 ms 1584 KB Output is correct
3 Correct 0 ms 1584 KB Output is correct
4 Correct 0 ms 1584 KB Output is correct
5 Correct 0 ms 1716 KB Output is correct
6 Correct 3 ms 1716 KB Output is correct
7 Correct 6 ms 1980 KB Output is correct
8 Correct 13 ms 2376 KB Output is correct
9 Correct 36 ms 3168 KB Output is correct
10 Correct 39 ms 3960 KB Output is correct
11 Correct 183 ms 9356 KB Output is correct
12 Correct 156 ms 6336 KB Output is correct
13 Correct 166 ms 7448 KB Output is correct
14 Correct 293 ms 10328 KB Output is correct
15 Correct 363 ms 12920 KB Output is correct
16 Correct 396 ms 14024 KB Output is correct
17 Correct 116 ms 7052 KB Output is correct
18 Correct 189 ms 9356 KB Output is correct
19 Correct 269 ms 15560 KB Output is correct
20 Correct 163 ms 13256 KB Output is correct

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 419 ms 2444 KB Output is correct
2 Correct 1576 ms 3356 KB Output is correct
3 Execution timed out 4000 ms 4016 KB Execution timed out
4 Halted 0 ms 0 KB -