Submission #1121482

#TimeUsernameProblemLanguageResultExecution timeMemory
1121482vjudge1Stranded Far From Home (BOI22_island)C++17
0 / 100
6 ms5164 KiB
#include <bits/stdc++.h> #define ll long long #define all(x) x.begin(), x.end() #define in insert #define F first #define S second #define ppf pop_front #define pb push_back #define ppb pop_back #define pf push_front #define pii pair <int, int> #define pll pair <ll, ll> #define boost() ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define sz(x) (int)x.size() using namespace std; const int N = 2e5+123; const ll mod = 1e9+7; vector<int> g[N]; void solve() { int n,m; cin >> n >> m; int a[n+1]; for(int i=1 ; i <= n ; i++){ cin >> a[i]; } for(int i=1 ; i <= m ; i++){ int v,u; cin >> v >> u; g[u].pb(v); g[v].pb(u); } char ans[n+1]; for(int i=n-1 ; i >= 1 ; i--){ if(a[i] == a[i+1]){ ans[i]='1'; ans[i+1]='1'; a[i]*=2; } else{ ans[i]='0'; } } for(int i=1 ; i <= n ; i++){ cout << ans[i]; } } /* 4 3 4 3 1 1 1 2 2 3 3 4 */ signed main() { boost(); int tt=1; //cin >> tt; while (tt--) { solve(); } return 0; }
#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...