oj.uz

답안 #22220

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
22220 2017-04-30T01:58:08 Z sgc109(#1015, sgc109) 구간들 (KRIII5P_3) C++11
7 / 7
 359 ms 28768 KB 
#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=a;i<=b;++i)
#define FOR(i,n) for(int i=0;i<n;++i)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
#define inp1(a) scanf("%d",&a)
#define inp2(a,b) scanf("%d%d",&a,&b)
#define inp3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define inp4(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c,&d)
#define inp5(a,b,c,d,e) scanf("%d%d%d%d%d",&a,&b,&c,&d,&e)
#define fastio() ios_base::sync_with_stdio(false),cin.tie(NULL)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;	
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vector<vector<int> > vvi;
typedef pair<int,pair<int,int> > piii;
typedef vector<piii> viii;
const double EPSILON = 1e-9;
const double PI = acos(-1);
const int MOD = 1e9+7;
const int INF = 0x3c3c3c3c;
const long long INFL = 0x3c3c3c3c3c3c3c3c;
const int MAX_N = 102;

int N;
set<ll> st;
vll range;
vl comp;
ll t[800003];
ll pow2[100003];
int size;
vll v;
void update(int pos, int v){
	while(pos <= size){
		t[pos] += v;
		pos += pos&-pos;
	}
}

ll query(int pos){
	ll ret = 0;
	while(pos > 0){
		ret += t[pos];
		pos -= pos&-pos;
	}
	return ret;
}

bool cmp(pll& A, pll& B){
	return A.second < B.second;
}

int main() {
	inp1(N);
	int cnt = 0;
	FOR(i,N){
		ll a,b;
		scanf("%lld%lld",&a,&b);
		if(a>=b) {
			cnt++;
			continue;
		}
		st.insert(a), st.insert(b);
		range.pb({a,b});
	}
	N-=cnt;
	for(auto it = st.begin() ; it != st.end(); it++){
		comp.pb((*it));
	}
	size = sz(comp);

	FOR(i,N){
		ll& a = range[i].first;
		ll& b = range[i].second;
		v.pb({a,1});
		v.pb({b,-1});
		a = lower_bound(all(comp),a) - comp.begin() + 1;
		b = lower_bound(all(comp),b) - comp.begin() + 1;
	}
	sort(all(v));
	sort(all(range),cmp);

	pow2[0] = 1;
	FOR(i,100001) pow2[i+1] = (pow2[i] * 2) % MOD;

	ll sum = 0;
	int on = 0;
	FOR(i,sz(v)){
		on += v[i].second;
		if(!on) continue;
		if(i!=sz(v)-1) sum = (sum + (v[i+1].first-v[i].first)*(pow2[on]-1)) % MOD;;
	}

	FOR(i,N) {
		update(range[i].first,1);
	}

	ll ans = 0;

	FOR(i,N){
		update(range[i].first,-1);
		ans = (ans + pow2[query(range[i].second-1)]) % MOD;
	}
	
	printf("%lld %lld",sum, ans);
	return 0;
}

Compilation message

i.cpp: In function 'int main()':
i.cpp:60:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  inp1(N);
         ^
i.cpp:64:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld",&a,&b);
                          ^

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 9200 KB Output is correct
2 Correct 0 ms 9192 KB Output is correct
3 Correct 0 ms 9192 KB Output is correct
4 Correct 0 ms 9192 KB Output is correct
5 Correct 0 ms 9192 KB Output is correct
6 Correct 6 ms 10172 KB Output is correct
7 Correct 3 ms 10172 KB Output is correct
8 Correct 9 ms 10172 KB Output is correct
9 Correct 3 ms 10172 KB Output is correct
10 Correct 6 ms 10172 KB Output is correct
11 Correct 76 ms 17344 KB Output is correct
12 Correct 79 ms 17344 KB Output is correct
13 Correct 73 ms 17344 KB Output is correct
14 Correct 63 ms 17344 KB Output is correct
15 Correct 83 ms 17344 KB Output is correct
16 Correct 143 ms 18964 KB Output is correct
17 Correct 169 ms 18952 KB Output is correct
18 Correct 156 ms 18980 KB Output is correct
19 Correct 143 ms 18968 KB Output is correct
20 Correct 109 ms 14864 KB Output is correct
21 Correct 316 ms 28768 KB Output is correct
22 Correct 333 ms 28768 KB Output is correct
23 Correct 323 ms 28768 KB Output is correct
24 Correct 339 ms 28768 KB Output is correct
25 Correct 83 ms 17352 KB Output is correct
26 Correct 296 ms 26336 KB Output is correct
27 Correct 233 ms 24468 KB Output is correct
28 Correct 196 ms 22204 KB Output is correct
29 Correct 189 ms 21760 KB Output is correct
30 Correct 179 ms 21048 KB Output is correct
31 Correct 153 ms 20584 KB Output is correct
32 Correct 143 ms 19984 KB Output is correct
33 Correct 133 ms 17704 KB Output is correct
34 Correct 106 ms 17472 KB Output is correct
35 Correct 109 ms 17404 KB Output is correct
36 Correct 319 ms 28764 KB Output is correct
37 Correct 359 ms 28768 KB Output is correct
38 Correct 359 ms 28764 KB Output is correct
39 Correct 319 ms 28768 KB Output is correct
40 Correct 333 ms 28768 KB Output is correct
41 Correct 0 ms 9192 KB Output is correct
42 Correct 0 ms 9192 KB Output is correct
43 Correct 3 ms 9616 KB Output is correct
44 Correct 3 ms 9616 KB Output is correct
45 Correct 69 ms 17124 KB Output is correct
46 Correct 76 ms 17124 KB Output is correct
47 Correct 66 ms 17124 KB Output is correct
48 Correct 163 ms 25100 KB Output is correct
49 Correct 179 ms 25100 KB Output is correct
50 Correct 183 ms 25100 KB Output is correct