Submission #1226938

#	Time	Username	Problem	Language	Result	Execution time	Memory
1226938		dksnfjkfnwkfw	Džumbus (COCI19_dzumbus)	C++20	0 / 110	145 ms	24736 KiB

dzumbus

#include <bits/stdc++.h>
using namespace std;

#define sonic ios_base::sync_with_stdio(false);cin.tie(0); cout.tie(0)
#define IO(main) if(fopen(main".inp","r")){freopen(main".inp","r",stdin);freopen(main".out","w",stdout);}
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define ins insert
#define pb push_back
#define el cout << endl
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define MASK(i) ((1LL)<<(i))
#define BIT(x,i) (((x)>>(i))&(1LL))
#define FOR(i, a, b) for(int (i)=(a);(i)<=(b); i++)
#define FORD(i, a, b) for(int (i)=(a);(i)>=(b); i--)


using ll = long long;
#define int ll
using ull = unsigned long long;
using ld = long double;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<pii>;

const int N = 1e6 + 9;
const int mod = 1e9 + 7;
const int INF = 1e9 + 7;
const int base = 31;
const int LOG = 20;
const ll MOD = 1e9 + 7;

int mul(int x, int y) {return 1LL * x * y % mod;}
int calPw(int x, int y)
{
    int ans = 1;
    while(y)
    {
        if (y&1) ans = 1LL * ans * x % mod;
        x = 1LL * x * x % mod;
        y >>= 1;
    }
    return ans;
}
int d4x[4] = {1, 0, -1, 0};
int d4y[4] = {0, 1, 0, -1};
int dx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int dy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
///Author: Le Chi Thien Luong The Vinh high school 2008
///code
template<class X, class Y>
bool minimize(X &x , Y y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}
void add(int &x, int y){
    x+=y;
    if(x >= mod)x-=mod;
}
void sub(int &x, int y){
    x-=y;
    if(x < 0)x+=mod;
}
void Solve(){

}
int n, m;
int a[N];
ll pre[N];
int id[N], cnt;
vector<int>adj[N];
void dfs(int u, int p){
    id[u] = ++cnt;
    for(int v : adj[u]){
        if(v == p)continue;
        dfs(v, u);
    }
}
bool check(int len, int Sum){
    FOR(i, 1, n - len + 1){
        int j = i + len - 1;
        if(pre[j] - pre[i - 1] <= Sum){
            return true;
        }
    }
    return false;
}
void Read(){
    cin >> n >> m;
    FOR(i, 1, n)cin >> a[i];
    FOR(i, 1, m){
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    FOR(i, 1, n){
        if(adj[i].size() == 1){
            dfs(i, i);
            break;
        }
    }
    FOR(i, 1, n){
        pre[i] = pre[i - 1] + a[id[i]];
    }
    int q;
    cin >> q;
    while(q--){
        int x;
        cin >> x;
        int l = 1, r = n;
        int ans = 0;
        while(l <= r){
            int mid = l + r >> 1;
            if(check(mid, x)){
                l = mid + 1;
                ans = mid;
            }
            else r = mid - 1;
        }
        if(ans <= 1)ans = 0;
        cout << ans << endl;
    }
}



signed main()
{
    sonic;

    int TEST =  1;
   // cin >> TEST;
    while(TEST--)
    {

        Read();
        Solve();
    }
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 30
• Subtask 3: 0 / 30
• Subtask 4: 0 / 30