oj.uz

답안 #523734

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
523734 2022-02-08T05:31:45 Z mansur Boat (APIO16_boat) C++17
9 / 100
 1844 ms 8464 KB 
#include<bits/stdc++.h>	
 
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")

//01001101 01100001 01101011 01101000 01100001  01100111 01100001 01111001 

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()                                                                   
#define ld double
#define ull unsigned long long
#define ff first                                         
#define ss second  
#define fix fixed << setprecision
#define pii pair<int, int>                          
#define E exit (0)
#define int long long
 
const int inf = 1e15, N = 1001, mod = 1e9 + 7;                    

double eps = 1e-6;

vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

int t[501][4 * N];

void update(int u, int tl, int tr, int pos, int tp, int val) {
	if (tl == tr) {
		t[tp][u] = val;
		return;
	}
	int mid = (tl + tr) / 2;
	if (pos <= mid) update(u * 2, tl, mid, pos, tp, val);
	else update(u * 2 + 1, mid + 1, tr, pos, tp, val);
	t[tp][u] = (t[tp][u * 2] + t[tp][u * 2 + 1]) % mod;
}

int get(int u, int tl, int tr, int l, int r, int tp) {
	if (tl > r || tr < l) return 0;
	if (tl >= l && tr <= r) return t[tp][u];
	int mid = (tl + tr) / 2;
	return (get(u * 2, tl, mid, l, r, tp) + get(u * 2 + 1, mid + 1, tr, l, r, tp)) % mod;
}

main() {                                                         
	//freopen("F.in", "r", stdin);                                                                                     
	//freopen("F.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                	                                                       
	cin.tie(NULL);
	int n;
	cin >> n;
	int a[n + 1], b[n + 1];
	vector<int> h;
	unordered_map<int, int> was;
	for (int i = 1; i <= n; i++) {
		cin >> a[i] >> b[i];
		if (!was[a[i]]) {
			h.pb(a[i]);
			was[a[i]] = 1;
		}
		if (!was[b[i]]) {
			h.pb(b[i]);
			was[b[i]] = 1;
		}
	}	
	sort(all(h));
	for (int i = 1; i <= n; i++) {
		a[i] = lower_bound(all(h), a[i]) - h.begin() + 1;
		b[i] = lower_bound(all(h), b[i]) - h.begin() + 1;
	}
	int ans = 0;
	update(1, 0, N - 1, 0, 0, 1);
	a[0] = 0, b[0] = 0;
	for (int i = 1; i <= n; i++) {
		for (int cur = a[i]; cur <= b[i]; cur++) {
			int val = 0;
			for (int j = 0; j < i; j++) {
				val = (val + get(1, 0, N - 1, 0, cur - 1, j)) % mod;
			}
			update(1, 0, N - 1, cur, i, val);
			ans = (ans + val) % mod;
		}
	}
	cout << ans;
}

Compilation message

boat.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize ("g",on)
      | 
boat.cpp:56:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   56 | main() {
      | ^~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 6732 KB Output is correct
2 Correct 10 ms 6732 KB Output is correct
3 Correct 9 ms 6772 KB Output is correct
4 Correct 9 ms 6736 KB Output is correct
5 Correct 10 ms 6824 KB Output is correct
6 Correct 9 ms 6736 KB Output is correct
7 Correct 8 ms 6732 KB Output is correct
8 Correct 9 ms 6804 KB Output is correct
9 Correct 9 ms 6732 KB Output is correct
10 Correct 8 ms 6732 KB Output is correct
11 Correct 9 ms 6732 KB Output is correct
12 Correct 13 ms 6824 KB Output is correct
13 Correct 11 ms 6732 KB Output is correct
14 Correct 9 ms 6732 KB Output is correct
15 Correct 9 ms 6732 KB Output is correct
16 Correct 7 ms 6400 KB Output is correct
17 Correct 8 ms 6348 KB Output is correct
18 Correct 7 ms 6348 KB Output is correct
19 Correct 7 ms 6348 KB Output is correct
20 Correct 7 ms 6348 KB Output is correct

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 6732 KB Output is correct
2 Correct 10 ms 6732 KB Output is correct
3 Correct 9 ms 6772 KB Output is correct
4 Correct 9 ms 6736 KB Output is correct
5 Correct 10 ms 6824 KB Output is correct
6 Correct 9 ms 6736 KB Output is correct
7 Correct 8 ms 6732 KB Output is correct
8 Correct 9 ms 6804 KB Output is correct
9 Correct 9 ms 6732 KB Output is correct
10 Correct 8 ms 6732 KB Output is correct
11 Correct 9 ms 6732 KB Output is correct
12 Correct 13 ms 6824 KB Output is correct
13 Correct 11 ms 6732 KB Output is correct
14 Correct 9 ms 6732 KB Output is correct
15 Correct 9 ms 6732 KB Output is correct
16 Correct 7 ms 6400 KB Output is correct
17 Correct 8 ms 6348 KB Output is correct
18 Correct 7 ms 6348 KB Output is correct
19 Correct 7 ms 6348 KB Output is correct
20 Correct 7 ms 6348 KB Output is correct
21 Incorrect 1844 ms 8464 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 1612 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 6732 KB Output is correct
2 Correct 10 ms 6732 KB Output is correct
3 Correct 9 ms 6772 KB Output is correct
4 Correct 9 ms 6736 KB Output is correct
5 Correct 10 ms 6824 KB Output is correct
6 Correct 9 ms 6736 KB Output is correct
7 Correct 8 ms 6732 KB Output is correct
8 Correct 9 ms 6804 KB Output is correct
9 Correct 9 ms 6732 KB Output is correct
10 Correct 8 ms 6732 KB Output is correct
11 Correct 9 ms 6732 KB Output is correct
12 Correct 13 ms 6824 KB Output is correct
13 Correct 11 ms 6732 KB Output is correct
14 Correct 9 ms 6732 KB Output is correct
15 Correct 9 ms 6732 KB Output is correct
16 Correct 7 ms 6400 KB Output is correct
17 Correct 8 ms 6348 KB Output is correct
18 Correct 7 ms 6348 KB Output is correct
19 Correct 7 ms 6348 KB Output is correct
20 Correct 7 ms 6348 KB Output is correct
21 Incorrect 1844 ms 8464 KB Output isn't correct
22 Halted 0 ms 0 KB -