Submission #1121634

#TimeUsernameProblemLanguageResultExecution timeMemory
1121634vjudge1Stranded Far From Home (BOI22_island)C++17
0 / 100
109 ms95816 KiB
#include <map> #include <set> #include <list> #include <cmath> #include <ctime> #include <deque> #include <queue> #include <stack> #include <string> #include <bitset> #include <cstdio> #include <limits> #include <vector> #include <climits> #include <cstring> #include <cstdlib> #include <fstream> #include <numeric> #include <sstream> #include <cassert> #include <iomanip> #include <iostream> #include <algorithm> #include <stdio.h> #include <fstream> #include <unordered_map> using namespace std; #define int long long #define ll long long #define ff first #define ss second #define pb push_back #define pf push_front #define UseOFF ios_base::sync_with_stdio(0);cin.tie(0), cout.tie(0); #define sz size #define ins insert #define new junkedseduneon #define prev usfdjik const ll N = 2e6 + 111; ll a[N]; vector <ll> v[N]; void solve() { ll n, m; cin >> n >> m; for(int i = 1; i <= n; i++) { cin >> a[i]; } for(int i = 1; i <= n; i++) { ll x, y; cin >> x >> y; v[x].pb(y); v[y].pb(x); } for(int i = 1; i <= n; i++) { bool bb = 0; for(auto to : v[i]) { if(a[to] <= a[i]) { cout << '1'; bb = 1; break; } } if(!bb) cout << '0'; } } signed main() { UseOFF ll ttt = 1; //cin >> ttt; while(ttt--) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...