# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
261702 | cheeheng | Colors (RMI18_colors) | C++14 | 79 ms | 7680 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
vector<int> AdjList[150005];
int a[150005];
int b[150005];
ii ab[150005];
int main(){
int t;
scanf("%d", &t);
while(t --){
int N, M;
scanf("%d%d", &N, &M);
for(int i = 0; i < N; i ++){
scanf("%d", &a[i]);
}
for(int i = 0; i < N; i ++){
scanf("%d", &b[i]);
}
for(int i = 0; i < M; i ++){
int u, v;
scanf("%d%d", &u, &v);
AdjList[u].push_back(v);
AdjList[v].push_back(u);
}
assert((long long)M == (long long)N*(N-1)/2);
multiset<int> s;
for(int i = 0; i < N; i ++){
ab[i] = ii(a[i], b[i]);
s.insert(a[i]);
}
sort(ab, ab+N, greater<ii>());
int ans = 1;
for(int i = 0; i < N; i ++){
if(ab[i].first == ab[i].second){continue;}
if(ab[i].first < ab[i].second){
ans = 0;
break;
}
if(s.find(ab[i].second) != s.end()){
}else{
ans = 0;
break;
}
s.erase(s.find(ab[i].first));
}
printf("%d\n", ans);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |