oj.uz

답안 #497527

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
497527 2021-12-23T08:15:59 Z mansur Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
21 / 100
 591 ms 18020 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")
#pragma comment(linker, "/stack:200000000")
 
//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 = 1e5, mod = 998244353;                    
 
vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
 
main() {                                                         
	//freopen("cowrect.in", "r", stdin);                                                                                     
	//freopen("cowrect.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                                                                        
	cin.tie(NULL);
	int n, q;
	cin >> n >> q;
	int w[n + 1], pref[n + 1];
	pref[1] = 0;
	for (int i = 1; i <= n; i++) cin >> w[i];
	for (int i = 2; i <= n; i++) {
		pref[i] = pref[i - 1] + (w[i] >= w[i - 1]);
	}
	while (q--) {
		int l, r, k, ok = 1;
		cin >> l >> r >> k;
		if (n > 500) {
			cout << (pref[r] - pref[l] == r - l) << nl;
			continue;
		}
		vector<pii> s;
		for (int i = l; i <= r; i++) {
			s.pb({w[i], i});
		}
		sort(all(s));
		for (int i = 0; i < sz(s); i++) {  
			for (int j = min(i + l, s[i].ss); j <= max(s[i].ss, i + l); j++) if (s[i].ff > w[j] && s[i].ff + w[j] > k) ok = 0;	
		}
		cout << ok << nl;
	}
}

Compilation message

sortbooks.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize ("g",on)
      | 
sortbooks.cpp:9: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    9 | #pragma comment(linker, "/stack:200000000")
      | 
sortbooks.cpp:35:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   35 | main() {
      | ^~~~
sortbooks.cpp: In function 'int main()':
sortbooks.cpp:60:21: 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]
   60 |   for (int i = 0; i < sz(s); i++) {
      |                     ^

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 3 ms 324 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 23 ms 332 KB Output is correct
7 Correct 23 ms 332 KB Output is correct
8 Correct 11 ms 332 KB Output is correct
9 Correct 7 ms 204 KB Output is correct
10 Correct 13 ms 204 KB Output is correct

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 3 ms 324 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 23 ms 332 KB Output is correct
7 Correct 23 ms 332 KB Output is correct
8 Correct 11 ms 332 KB Output is correct
9 Correct 7 ms 204 KB Output is correct
10 Correct 13 ms 204 KB Output is correct
11 Incorrect 2 ms 332 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 531 ms 17872 KB Output is correct
2 Correct 510 ms 17892 KB Output is correct
3 Correct 591 ms 17860 KB Output is correct
4 Correct 484 ms 18020 KB Output is correct
5 Correct 483 ms 17860 KB Output is correct

Subtask #4
0 / 17.0

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

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 3 ms 324 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 23 ms 332 KB Output is correct
7 Correct 23 ms 332 KB Output is correct
8 Correct 11 ms 332 KB Output is correct
9 Correct 7 ms 204 KB Output is correct
10 Correct 13 ms 204 KB Output is correct
11 Incorrect 2 ms 332 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 3 ms 324 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 23 ms 332 KB Output is correct
7 Correct 23 ms 332 KB Output is correct
8 Correct 11 ms 332 KB Output is correct
9 Correct 7 ms 204 KB Output is correct
10 Correct 13 ms 204 KB Output is correct
11 Incorrect 2 ms 332 KB Output isn't correct
12 Halted 0 ms 0 KB -