oj.uz

Submission #135747

# Submission time Handle Problem Language Result Execution time Memory
135747 2019-07-24T10:30:13 Z Runtime_error_ Detecting Molecules (IOI16_molecules) C++14
10 / 100
 2 ms 504 KB 
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
const int inf = 2e5+9;
int n,pre[inf];
pair<int,int> a[inf];

vector<int> find_subset(int l, int r, vector<int> w) {
    vector<int> ans;
    n = w.size();
    for(int i=1;i<=n;i++)
        a[i] = make_pair(w[i-1],i-1);

    sort(a+1,a+1+n);
    for(int i=1;i<=n;i++)
        pre[i] = pre[i-1]+a[i].first;

    set<pair<int,int> > s;

    for(int i=1;i<=n;i++){

        s.insert(make_pair(pre[i-1],i));
        set< pair<int,int> > ::iterator it = s.lower_bound( make_pair( pre[i]-r , 0 ) );
        if( it->first > pre[i] - l )
            continue;
        assert(pre[i]-pre[it->second-1]>=l && pre[i]-pre[it->second-1]<=r);
        for(int j = it->second ; j <= i ;j++){
            ans.push_back(a[j].second);
            assert(a[j].second<n);
        }
        return ans;

        /*for(int j=i;j<=n;j++){
            if(pre[j] - pre[i-1] >=l && pre[j] - pre[i-1] <= r){
                for(int z=i;z<=j;z++)
                    ans.push_back(a[z].second-1);
                return ans;
            }
        }*/
    }

    return ans;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 452 KB OK (n = 1, answer = NO)
2 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB OK (n = 12, answer = YES)
2 Correct 2 ms 256 KB OK (n = 12, answer = YES)
3 Correct 2 ms 376 KB OK (n = 12, answer = NO)
4 Correct 2 ms 376 KB OK (n = 12, answer = NO)
5 Correct 2 ms 376 KB OK (n = 12, answer = YES)
6 Correct 2 ms 380 KB OK (n = 12, answer = YES)
7 Correct 2 ms 376 KB OK (n = 12, answer = YES)
8 Correct 2 ms 376 KB OK (n = 12, answer = YES)
9 Correct 2 ms 256 KB OK (n = 6, answer = YES)
10 Correct 2 ms 376 KB OK (n = 12, answer = YES)
11 Correct 2 ms 380 KB OK (n = 100, answer = NO)
12 Correct 2 ms 376 KB OK (n = 100, answer = YES)
13 Correct 2 ms 376 KB OK (n = 100, answer = NO)
14 Correct 2 ms 376 KB OK (n = 100, answer = YES)
15 Correct 2 ms 376 KB OK (n = 100, answer = YES)
16 Correct 2 ms 376 KB OK (n = 100, answer = YES)
17 Correct 2 ms 376 KB OK (n = 100, answer = YES)

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 452 KB OK (n = 1, answer = NO)
2 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 452 KB OK (n = 1, answer = NO)
2 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 452 KB OK (n = 1, answer = NO)
2 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 452 KB OK (n = 1, answer = NO)
2 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -