oj.uz

Submission #167058

# Submission time Handle Problem Language Result Execution time Memory
167058 2019-12-05T11:57:06 Z Dilshod_Imomov Detecting Molecules (IOI16_molecules) C++17
19 / 100
 3 ms 424 KB 
# include <bits/stdc++.h>
//# pragma GCC optimize("Ofast")
# define pb push_back
# define ll long long
# define fi first
# define se second
# define all(vc) vc.begin(),vc.end()
# define forn(i, n) for (int i = 0; i < int(n); i++)
# define ford(i, n) for (int i = int(n) - 1; i >= 0; i--)
# define fore(i, l, r) for (int i = int(l); i < int(r); i++)
# define in freopen("input.txt", "r", stdin)
# define speed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
# define time cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"
  
using namespace std;
  
const ll INF = 1e18;
const int mod = 1e9 + 7;
const int N = 2e5 + 7;

vector < int > find_subset( int l, int u, vector < int > w ) 
{
    int n = w.size();
    vector < pair < int, int > > vc(n);
    forn( i, n ) {
        vc[i].fi = w[i];
        vc[i].se = i;
    }
    ll sum = 0;
    vector < int > ans;
    for( int i = 0, j = 0; j < n; j++ ) {
        sum += vc[j].fi;
        while ( sum > u ) {
            sum -= vc[i++].fi;
        }
        if ( sum >= l ) {
            fore( k, i, j + 1 ) ans.pb( vc[k].se );
            break;
        }
    }
    return ans;
} 
/*
int main()
{      
    speed;
    int l, u, n;
    cin >> n >> l >> u;
    vector < int > vc(n);
    forn( i, n ) cin >> vc[i];
    auto v = find_subset( l, u, vc );
    for( auto i: v ) cout << i << endl;
    time;
}*/

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB OK (n = 12, answer = YES)
2 Correct 2 ms 356 KB OK (n = 12, answer = YES)
3 Correct 2 ms 360 KB OK (n = 12, answer = NO)
4 Correct 2 ms 256 KB OK (n = 12, answer = NO)
5 Correct 2 ms 256 KB OK (n = 12, answer = YES)
6 Correct 2 ms 376 KB OK (n = 12, answer = YES)
7 Correct 2 ms 376 KB OK (n = 12, answer = YES)
8 Correct 2 ms 256 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 376 KB OK (n = 100, answer = NO)
12 Correct 2 ms 256 KB OK (n = 100, answer = YES)
13 Correct 2 ms 256 KB OK (n = 100, answer = NO)
14 Correct 2 ms 256 KB OK (n = 100, answer = YES)
15 Correct 2 ms 256 KB OK (n = 100, answer = YES)
16 Correct 2 ms 252 KB OK (n = 100, answer = YES)
17 Correct 2 ms 256 KB OK (n = 100, answer = YES)

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 376 KB OK (n = 1, answer = YES)
4 Correct 2 ms 256 KB OK (n = 2, answer = YES)
5 Correct 2 ms 256 KB OK (n = 2, answer = YES)
6 Correct 2 ms 256 KB OK (n = 3, answer = YES)
7 Correct 2 ms 256 KB OK (n = 3, answer = YES)
8 Correct 2 ms 256 KB OK (n = 3, answer = YES)
9 Correct 2 ms 256 KB OK (n = 3, answer = YES)
10 Correct 3 ms 376 KB OK (n = 3, answer = YES)
11 Correct 2 ms 376 KB OK (n = 3, answer = YES)
12 Correct 2 ms 376 KB OK (n = 3, answer = YES)
13 Correct 2 ms 376 KB OK (n = 3, answer = NO)
14 Correct 2 ms 256 KB OK (n = 3, answer = YES)
15 Correct 2 ms 376 KB OK (n = 3, answer = YES)
16 Correct 2 ms 256 KB OK (n = 3, answer = NO)
17 Correct 2 ms 256 KB OK (n = 3, answer = NO)
18 Correct 2 ms 376 KB OK (n = 100, answer = NO)
19 Correct 2 ms 256 KB OK (n = 100, answer = YES)
20 Correct 2 ms 256 KB OK (n = 12, answer = YES)
21 Correct 2 ms 356 KB OK (n = 12, answer = YES)
22 Correct 2 ms 360 KB OK (n = 12, answer = NO)
23 Correct 2 ms 256 KB OK (n = 12, answer = NO)
24 Correct 2 ms 256 KB OK (n = 12, answer = YES)
25 Correct 2 ms 376 KB OK (n = 12, answer = YES)
26 Correct 2 ms 376 KB OK (n = 12, answer = YES)
27 Correct 2 ms 256 KB OK (n = 12, answer = YES)
28 Correct 2 ms 256 KB OK (n = 6, answer = YES)
29 Correct 2 ms 376 KB OK (n = 12, answer = YES)
30 Correct 2 ms 376 KB OK (n = 100, answer = NO)
31 Correct 2 ms 256 KB OK (n = 100, answer = YES)
32 Correct 2 ms 256 KB OK (n = 100, answer = NO)
33 Correct 2 ms 256 KB OK (n = 100, answer = YES)
34 Correct 2 ms 256 KB OK (n = 100, answer = YES)
35 Correct 2 ms 252 KB OK (n = 100, answer = YES)
36 Correct 2 ms 256 KB OK (n = 100, answer = YES)
37 Correct 2 ms 424 KB OK (n = 28, answer = YES)
38 Correct 2 ms 256 KB OK (n = 27, answer = YES)
39 Correct 2 ms 256 KB OK (n = 90, answer = YES)
40 Correct 2 ms 256 KB OK (n = 100, answer = YES)
41 Correct 2 ms 376 KB OK (n = 100, answer = YES)
42 Correct 2 ms 256 KB OK (n = 10, answer = YES)
43 Correct 3 ms 396 KB OK (n = 100, answer = YES)
44 Correct 2 ms 252 KB OK (n = 100, answer = YES)
45 Incorrect 2 ms 252 KB Contestant can not find answer, jury can
46 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 376 KB OK (n = 1, answer = YES)
4 Correct 2 ms 256 KB OK (n = 2, answer = YES)
5 Correct 2 ms 256 KB OK (n = 2, answer = YES)
6 Correct 2 ms 256 KB OK (n = 3, answer = YES)
7 Correct 2 ms 256 KB OK (n = 3, answer = YES)
8 Correct 2 ms 256 KB OK (n = 3, answer = YES)
9 Correct 2 ms 256 KB OK (n = 3, answer = YES)
10 Correct 3 ms 376 KB OK (n = 3, answer = YES)
11 Correct 2 ms 376 KB OK (n = 3, answer = YES)
12 Correct 2 ms 376 KB OK (n = 3, answer = YES)
13 Correct 2 ms 376 KB OK (n = 3, answer = NO)
14 Correct 2 ms 256 KB OK (n = 3, answer = YES)
15 Correct 2 ms 376 KB OK (n = 3, answer = YES)
16 Correct 2 ms 256 KB OK (n = 3, answer = NO)
17 Correct 2 ms 256 KB OK (n = 3, answer = NO)
18 Correct 2 ms 376 KB OK (n = 100, answer = NO)
19 Correct 2 ms 256 KB OK (n = 100, answer = YES)
20 Correct 2 ms 256 KB OK (n = 12, answer = YES)
21 Correct 2 ms 356 KB OK (n = 12, answer = YES)
22 Correct 2 ms 360 KB OK (n = 12, answer = NO)
23 Correct 2 ms 256 KB OK (n = 12, answer = NO)
24 Correct 2 ms 256 KB OK (n = 12, answer = YES)
25 Correct 2 ms 376 KB OK (n = 12, answer = YES)
26 Correct 2 ms 376 KB OK (n = 12, answer = YES)
27 Correct 2 ms 256 KB OK (n = 12, answer = YES)
28 Correct 2 ms 256 KB OK (n = 6, answer = YES)
29 Correct 2 ms 376 KB OK (n = 12, answer = YES)
30 Correct 2 ms 376 KB OK (n = 100, answer = NO)
31 Correct 2 ms 256 KB OK (n = 100, answer = YES)
32 Correct 2 ms 256 KB OK (n = 100, answer = NO)
33 Correct 2 ms 256 KB OK (n = 100, answer = YES)
34 Correct 2 ms 256 KB OK (n = 100, answer = YES)
35 Correct 2 ms 252 KB OK (n = 100, answer = YES)
36 Correct 2 ms 256 KB OK (n = 100, answer = YES)
37 Correct 2 ms 424 KB OK (n = 28, answer = YES)
38 Correct 2 ms 256 KB OK (n = 27, answer = YES)
39 Correct 2 ms 256 KB OK (n = 90, answer = YES)
40 Correct 2 ms 256 KB OK (n = 100, answer = YES)
41 Correct 2 ms 376 KB OK (n = 100, answer = YES)
42 Correct 2 ms 256 KB OK (n = 10, answer = YES)
43 Correct 3 ms 396 KB OK (n = 100, answer = YES)
44 Correct 2 ms 252 KB OK (n = 100, answer = YES)
45 Incorrect 2 ms 252 KB Contestant can not find answer, jury can
46 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 376 KB OK (n = 1, answer = YES)
4 Correct 2 ms 256 KB OK (n = 2, answer = YES)
5 Correct 2 ms 256 KB OK (n = 2, answer = YES)
6 Correct 2 ms 256 KB OK (n = 3, answer = YES)
7 Correct 2 ms 256 KB OK (n = 3, answer = YES)
8 Correct 2 ms 256 KB OK (n = 3, answer = YES)
9 Correct 2 ms 256 KB OK (n = 3, answer = YES)
10 Correct 3 ms 376 KB OK (n = 3, answer = YES)
11 Correct 2 ms 376 KB OK (n = 3, answer = YES)
12 Correct 2 ms 376 KB OK (n = 3, answer = YES)
13 Correct 2 ms 376 KB OK (n = 3, answer = NO)
14 Correct 2 ms 256 KB OK (n = 3, answer = YES)
15 Correct 2 ms 376 KB OK (n = 3, answer = YES)
16 Correct 2 ms 256 KB OK (n = 3, answer = NO)
17 Correct 2 ms 256 KB OK (n = 3, answer = NO)
18 Correct 2 ms 376 KB OK (n = 100, answer = NO)
19 Correct 2 ms 256 KB OK (n = 100, answer = YES)
20 Correct 2 ms 256 KB OK (n = 12, answer = YES)
21 Correct 2 ms 356 KB OK (n = 12, answer = YES)
22 Correct 2 ms 360 KB OK (n = 12, answer = NO)
23 Correct 2 ms 256 KB OK (n = 12, answer = NO)
24 Correct 2 ms 256 KB OK (n = 12, answer = YES)
25 Correct 2 ms 376 KB OK (n = 12, answer = YES)
26 Correct 2 ms 376 KB OK (n = 12, answer = YES)
27 Correct 2 ms 256 KB OK (n = 12, answer = YES)
28 Correct 2 ms 256 KB OK (n = 6, answer = YES)
29 Correct 2 ms 376 KB OK (n = 12, answer = YES)
30 Correct 2 ms 376 KB OK (n = 100, answer = NO)
31 Correct 2 ms 256 KB OK (n = 100, answer = YES)
32 Correct 2 ms 256 KB OK (n = 100, answer = NO)
33 Correct 2 ms 256 KB OK (n = 100, answer = YES)
34 Correct 2 ms 256 KB OK (n = 100, answer = YES)
35 Correct 2 ms 252 KB OK (n = 100, answer = YES)
36 Correct 2 ms 256 KB OK (n = 100, answer = YES)
37 Correct 2 ms 424 KB OK (n = 28, answer = YES)
38 Correct 2 ms 256 KB OK (n = 27, answer = YES)
39 Correct 2 ms 256 KB OK (n = 90, answer = YES)
40 Correct 2 ms 256 KB OK (n = 100, answer = YES)
41 Correct 2 ms 376 KB OK (n = 100, answer = YES)
42 Correct 2 ms 256 KB OK (n = 10, answer = YES)
43 Correct 3 ms 396 KB OK (n = 100, answer = YES)
44 Correct 2 ms 252 KB OK (n = 100, answer = YES)
45 Incorrect 2 ms 252 KB Contestant can not find answer, jury can
46 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 376 KB OK (n = 1, answer = YES)
4 Correct 2 ms 256 KB OK (n = 2, answer = YES)
5 Correct 2 ms 256 KB OK (n = 2, answer = YES)
6 Correct 2 ms 256 KB OK (n = 3, answer = YES)
7 Correct 2 ms 256 KB OK (n = 3, answer = YES)
8 Correct 2 ms 256 KB OK (n = 3, answer = YES)
9 Correct 2 ms 256 KB OK (n = 3, answer = YES)
10 Correct 3 ms 376 KB OK (n = 3, answer = YES)
11 Correct 2 ms 376 KB OK (n = 3, answer = YES)
12 Correct 2 ms 376 KB OK (n = 3, answer = YES)
13 Correct 2 ms 376 KB OK (n = 3, answer = NO)
14 Correct 2 ms 256 KB OK (n = 3, answer = YES)
15 Correct 2 ms 376 KB OK (n = 3, answer = YES)
16 Correct 2 ms 256 KB OK (n = 3, answer = NO)
17 Correct 2 ms 256 KB OK (n = 3, answer = NO)
18 Correct 2 ms 376 KB OK (n = 100, answer = NO)
19 Correct 2 ms 256 KB OK (n = 100, answer = YES)
20 Correct 2 ms 256 KB OK (n = 12, answer = YES)
21 Correct 2 ms 356 KB OK (n = 12, answer = YES)
22 Correct 2 ms 360 KB OK (n = 12, answer = NO)
23 Correct 2 ms 256 KB OK (n = 12, answer = NO)
24 Correct 2 ms 256 KB OK (n = 12, answer = YES)
25 Correct 2 ms 376 KB OK (n = 12, answer = YES)
26 Correct 2 ms 376 KB OK (n = 12, answer = YES)
27 Correct 2 ms 256 KB OK (n = 12, answer = YES)
28 Correct 2 ms 256 KB OK (n = 6, answer = YES)
29 Correct 2 ms 376 KB OK (n = 12, answer = YES)
30 Correct 2 ms 376 KB OK (n = 100, answer = NO)
31 Correct 2 ms 256 KB OK (n = 100, answer = YES)
32 Correct 2 ms 256 KB OK (n = 100, answer = NO)
33 Correct 2 ms 256 KB OK (n = 100, answer = YES)
34 Correct 2 ms 256 KB OK (n = 100, answer = YES)
35 Correct 2 ms 252 KB OK (n = 100, answer = YES)
36 Correct 2 ms 256 KB OK (n = 100, answer = YES)
37 Correct 2 ms 424 KB OK (n = 28, answer = YES)
38 Correct 2 ms 256 KB OK (n = 27, answer = YES)
39 Correct 2 ms 256 KB OK (n = 90, answer = YES)
40 Correct 2 ms 256 KB OK (n = 100, answer = YES)
41 Correct 2 ms 376 KB OK (n = 100, answer = YES)
42 Correct 2 ms 256 KB OK (n = 10, answer = YES)
43 Correct 3 ms 396 KB OK (n = 100, answer = YES)
44 Correct 2 ms 252 KB OK (n = 100, answer = YES)
45 Incorrect 2 ms 252 KB Contestant can not find answer, jury can
46 Halted 0 ms 0 KB -