oj.uz

Submission #165027

# Submission time Handle Problem Language Result Execution time Memory
165027 2019-11-24T17:21:37 Z Sparky_09 Detecting Molecules (IOI16_molecules) C++17
0 / 100
 2 ms 376 KB 
#include<bits/stdc++.h>
#ifdef LOCAL_DEFINE
#include<conio.h>
#endif
using namespace std;
void io();
void end();

vector<int> find_subset(int l, int u, vector<int> v){
    int n = v.size();
    vector<pair<int, int>> p(n);
    vector<int> ans(0), pref(n+1, 0);

    for(int i = 0; i < n; i++){
        p[i] = {v[i], i};
        pref[i+1]=pref[i]+v[i];
        if(v[i]>=l and v[i]<=u){ ans.push_back(v[i]); return ans; }
    }

    for(auto i: pref) cout << i << ' ';

    int ll = -1, r = -1;
    sort(p.begin(), p.end());
    for(int i = 0, j = 1; j<n;){
        //cerr << 'h';
        if(i==j) j++;
        if(pref[j]-pref[i]>u) i++;
        else if(pref[j]-pref[i]<l) j++;
        else{ ll = i; r = j-1; break;} 
    }

    if(ll!=-1) for(int i = ll; i <= r; i++) ans.push_back(p[i].first);

    return ans;
}
/*
int main(){
    io();
    int l, u, n;
    cin >> l >> u >> n;
    vector<int> v(n);
    for(int& i: v) cin >> i;
    vector<int> z = find_subset(l, u, v);
    for(auto i: z) cout << i << ' ';
    end();
}
*/

void io(){
#ifdef LOCAL_DEFINE
	ios_base::sync_with_stdio(0); cin.tie(0);
	freopen("input.txt", "rt", stdin);
#endif
}

void end(){	
#ifdef LOCAL_DEFINE
	cerr << "\nTime Elapsed: " << 1.0 * clock()/CLOCKS_PER_SEC << " s.\n";
	getch();
#endif
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Secret is incorrect!
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 348 KB Secret is incorrect!
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Secret is incorrect!
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Secret is incorrect!
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Secret is incorrect!
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Secret is incorrect!
2 Halted 0 ms 0 KB -