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>
#define ll long long
#define ull unsigned ll
#define ld long double
#define pb push_back
#define pf push_front
#define pii pair<int, int>
#define pllll pair<ll, ll>
#define size(v) v.size()
#define all(v) v.begin(), v.end()
#define INF 2e9
#define f first
#define s second
using namespace std;
void solve(){
int n, m;
cin >> n >> m;
vector<ll>s(n + 1), Sum(n + 1, 0);
for(int i = 1; i <= n; ++i){
cin >> s[i];
Sum[i] = Sum[i - 1] + s[i];
}
for(int i = 1; i <= m; ++i){
int u, v;
cin >> u >> v;
}
string S = "1";
int flag = 0;
for(int i = 2; i <= n; ++i){
if(Sum[n] - Sum[i - 1] >= s[i - 1] && !flag){
S += '1';
}else{
S += '0';
flag = 1;
}
}
cout << S;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
// cin >> t;
t = 1;
while(t--){
solve();
}
return 0;
}
# | 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... |