답안 #764622

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
764622 2023-06-23T16:37:39 Z Ahmed57 Boat (APIO16_boat) C++17
9 / 100
894 ms 52612 KB
#include <bits/stdc++.h>
using namespace std;
#define int long long
long long z = 0;
long long bit[1000001];
long long mod = 1000000007;
void add(long long e,long long v){
    while(e<=z){
        bit[e]+=v;
        bit[e]%=mod;
        e+=(e&-e);
    }
}
long long sum(long long e){
    long long res = 0;
    while(e>=1){
        res+=bit[e];
        res%=mod;
        e-=(e&-e);
    }
    return res;
}
signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n;
    cin>>n;
    map<long long,long long> comp,sav;
    vector<pair<long long,long long>> v;
    vector<long long> ans;
    for(int i = 0;i<n;i++){
        long long x,y;
        cin>>x>>y;
        v.push_back({x,y});
        for(int i = x-10;i<=x+10;i++){
            ans.push_back(i);
        }
        for(int i = y-360;i<=y+360;i++){
            ans.push_back(i);
        }
    }
    sort(ans.begin(),ans.end());
    vector<pair<long long,long long>> all[n];
    for(int i = 0;i<v.size();i++){
        long long st = v[i].first;
        while(st<=v[i].second){
            int it = lower_bound(ans.begin(),ans.end(),st+1)-ans.begin();
            all[i].push_back({st,ans[it]-1});
            comp[st]++;comp[ans[it]-1]++;
            st = ans[it];
        }
    }
    for(auto i:comp){
        sav[i.first] = ++z;
    }
    long long fin = 0;
    for(int i = n-1;i>=0;i--){
        for(auto j:all[i]){
            long long val = (((sum(z)-sum(sav[j.second])+1)%mod)+mod)%mod;
            long long sz = (val*((j.second-j.first+1)%mod))%mod;
            fin+=sz;fin%=mod;
            add(sav[j.first],sz);
        }
    }
    cout<<fin<<endl;
}

Compilation message

boat.cpp: In function 'int main()':
boat.cpp:43:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     for(int i = 0;i<v.size();i++){
      |                   ~^~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 4556 KB Output is correct
2 Correct 16 ms 4556 KB Output is correct
3 Correct 13 ms 4556 KB Output is correct
4 Correct 13 ms 4556 KB Output is correct
5 Correct 13 ms 4556 KB Output is correct
6 Correct 9 ms 4556 KB Output is correct
7 Correct 11 ms 4556 KB Output is correct
8 Correct 8 ms 4556 KB Output is correct
9 Correct 9 ms 4556 KB Output is correct
10 Correct 9 ms 4556 KB Output is correct
11 Correct 9 ms 4556 KB Output is correct
12 Correct 9 ms 4560 KB Output is correct
13 Correct 9 ms 4556 KB Output is correct
14 Correct 8 ms 4556 KB Output is correct
15 Correct 11 ms 4556 KB Output is correct
16 Correct 15 ms 4556 KB Output is correct
17 Correct 18 ms 4556 KB Output is correct
18 Correct 17 ms 4556 KB Output is correct
19 Correct 14 ms 4556 KB Output is correct
20 Correct 14 ms 4556 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 4556 KB Output is correct
2 Correct 16 ms 4556 KB Output is correct
3 Correct 13 ms 4556 KB Output is correct
4 Correct 13 ms 4556 KB Output is correct
5 Correct 13 ms 4556 KB Output is correct
6 Correct 9 ms 4556 KB Output is correct
7 Correct 11 ms 4556 KB Output is correct
8 Correct 8 ms 4556 KB Output is correct
9 Correct 9 ms 4556 KB Output is correct
10 Correct 9 ms 4556 KB Output is correct
11 Correct 9 ms 4556 KB Output is correct
12 Correct 9 ms 4560 KB Output is correct
13 Correct 9 ms 4556 KB Output is correct
14 Correct 8 ms 4556 KB Output is correct
15 Correct 11 ms 4556 KB Output is correct
16 Correct 15 ms 4556 KB Output is correct
17 Correct 18 ms 4556 KB Output is correct
18 Correct 17 ms 4556 KB Output is correct
19 Correct 14 ms 4556 KB Output is correct
20 Correct 14 ms 4556 KB Output is correct
21 Correct 262 ms 19804 KB Output is correct
22 Correct 262 ms 19692 KB Output is correct
23 Correct 259 ms 18988 KB Output is correct
24 Correct 273 ms 20252 KB Output is correct
25 Correct 279 ms 20116 KB Output is correct
26 Incorrect 298 ms 19776 KB Output isn't correct
27 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 894 ms 52612 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 4556 KB Output is correct
2 Correct 16 ms 4556 KB Output is correct
3 Correct 13 ms 4556 KB Output is correct
4 Correct 13 ms 4556 KB Output is correct
5 Correct 13 ms 4556 KB Output is correct
6 Correct 9 ms 4556 KB Output is correct
7 Correct 11 ms 4556 KB Output is correct
8 Correct 8 ms 4556 KB Output is correct
9 Correct 9 ms 4556 KB Output is correct
10 Correct 9 ms 4556 KB Output is correct
11 Correct 9 ms 4556 KB Output is correct
12 Correct 9 ms 4560 KB Output is correct
13 Correct 9 ms 4556 KB Output is correct
14 Correct 8 ms 4556 KB Output is correct
15 Correct 11 ms 4556 KB Output is correct
16 Correct 15 ms 4556 KB Output is correct
17 Correct 18 ms 4556 KB Output is correct
18 Correct 17 ms 4556 KB Output is correct
19 Correct 14 ms 4556 KB Output is correct
20 Correct 14 ms 4556 KB Output is correct
21 Correct 262 ms 19804 KB Output is correct
22 Correct 262 ms 19692 KB Output is correct
23 Correct 259 ms 18988 KB Output is correct
24 Correct 273 ms 20252 KB Output is correct
25 Correct 279 ms 20116 KB Output is correct
26 Incorrect 298 ms 19776 KB Output isn't correct
27 Halted 0 ms 0 KB -