oj.uz

답안 #889890

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
889890 2023-12-20T09:10:46 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
0 / 100
 232 ms 262144 KB 
#include <bits/stdc++.h>
#define ll long long
#define fort(x , y) for(int y = 1 ; y <= x ; y++)
#define pb push_back
#define pf push_front
#define ppb pop_back
#define int long long
#define F first
#define S second
using namespace std;
const int N = 2e5 + 5;
const int NN = 1e9 + 7;
int n,m,w[N],l,r,k,p[N],b[N],used[N];
vector <int> g[N];
void dfs(int v){
	used[v] = 1;
	for(auto to : g[v]){
		if(used[to] == 0){
			dfs(to);
		}
	}
}
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin >> n >> m;
	for(int i = 1 ; i <= n ; i++){
		cin >> w[i];
		p[i] = p[i - 1] + w[i];
		b[i] = w[i];
	}
	//sort(b + 1 , b + n + 1);
	for(int j = 1 ; j <= m ; j++){
		cin >> l >> r >> k;
		if(l == r){
			if(w[l] <= k){
				cout << 1 << '\n';
			}
			else{
				cout << 0 << '\n';
			}
			continue;
		}
		int ans = 0;
		//sort(b + l , b + r + 1);
		for(int i = l ; i <= r ; i++){
			for(int u = i + 1 ; u <= r ; u++){
				if(w[i] + w[u] <= k){
					g[w[i]].pb(w[u]);
					g[w[u]].pb(w[i]);
				}
			}
		}
		dfs(w[l]);
		bool oknt = 0;
		for(int i = l ; i <= r ; i++){
			if(used[w[i]] == 0){
				oknt = 1;
				break;
			}
		}
		if(oknt){
			cout << 0 << '\n';
		}
		else{
			cout << 1 << '\n';
		}
		for(int i = l ; i <= r ; i++){
			used[w[i]] = 0;
		}
	}

}

Compilation message

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:44:7: warning: unused variable 'ans' [-Wunused-variable]
   44 |   int ans = 0;
      |       ^~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8796 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Runtime error 8 ms 17500 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8796 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Runtime error 8 ms 17500 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 29 ms 24404 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 232 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8796 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Runtime error 8 ms 17500 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8796 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Runtime error 8 ms 17500 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -