답안 #1057514

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1057514 2024-08-13T20:51:41 Z beaconmc Gift Exchange (JOI24_ho_t4) C++14
0 / 100
2500 ms 9356 KB
#include <bits/stdc++.h>
 
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
 
using namespace std;


int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	ll n;
	cin >> n;
	vector<ll> vals(n), req(n);
	FOR(i,0,n) cin >> vals[i];
	FOR(i,0,n) cin >> req[i];
	ll q;
	cin >> q;
	FOR(i,0,q){
		ll a,b;
		cin >> a >> b;
		a--;b--;
		vector<vector<ll>> sus;
		FOR(j,a,b+1){
			sus.push_back({vals[j], req[j]});
		}
		sort(sus.begin(), sus.end());
		if (sus[0][0] >= sus[sus.size()-1][1]) cout << "Yes" << "\n";
		else cout << "No" << "\n";

	}




}
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Execution timed out 2583 ms 9356 KB Time limit exceeded
5 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Execution timed out 2583 ms 9356 KB Time limit exceeded
5 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -