답안 #943299

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
943299 2024-03-11T10:17:10 Z Lilypad Curtains (NOI23_curtains) C++14
0 / 100
1 ms 4444 KB
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<ll,ll>
#define pb push_back
#define fi first
#define se second

const ll N = 2003;

ll n,m,q,x,y;
ll s[N],e[N];
ll ans[N][N];
pii a[N];

bool cmp(pii x, pii y) {
	return x.se < y.se;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m >> q;
	for(int i=1; i<=m; i++) {
		cin >> a[i].fi >> a[i].se;
		ans[a[i].fi][a[i].se] = true;
	}
	sort(a+1,a+m+1,cmp);
	for(int i=1; i<=m; i++) {
		for(int j=1; j<a[i].fi; j++) {
			if(ans[j][a[i].fi-1]) {
				ans[j][a[i].se] = true;
			}
		}
	}
	while(q--) {
		cin >> x >> y;
		if(ans[x][y]) cout << "YES" << endl;
		else cout << "NO" << endl;
	}
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Incorrect 1 ms 4444 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Incorrect 1 ms 4444 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Incorrect 1 ms 4444 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Incorrect 1 ms 4444 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Incorrect 1 ms 4444 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Incorrect 1 ms 4444 KB Output isn't correct
4 Halted 0 ms 0 KB -