oj.uz

답안 #239224

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
239224 2020-06-14T21:09:54 Z lakshith_ Detecting Molecules (IOI16_molecules) C++14
9 / 100
 5 ms 384 KB 
#include <bits/stdc++.h>
#define pb push_back

using namespace std;


vector <int> find_subset (int l, int u, vector <int> w){
  int n=w.size();
  bool equal = true;
  int tmp = w[0];
  for(int i=0;i<n;i++)if(w[i]!=tmp){equal=false;break;}
  if(equal){
    vector<int> result;
    int m=0,sum=0;
    for(int i=0;i<n;i++)
      if(sum>=l&&sum<=u&&sum!=0)break;
      else sum+=w[i];
    if(sum>=l&&sum<=u){
      m = sum/w[0];
      for(int i=0;i<m;i++)result.pb(i);
    }
    return result;
  }else{
    int a=0,b=0;
    vector<pair<int,int>> vec;
    for(int i=0;i<n;i++)vec.pb({w[i],i});
    sort(vec.begin(),vec.end());
    int MIN = w[0];
    int MAX = w[vec.size()-1];
    for(int i=0;i<w.size();i++)if(w[i]==MIN)a++;else b++;
    int A = -1,B=-1;
    for(int i=0;i<=a;i++)
      for(int j=0;j<=b;j++)
        if(i*MIN+j*MAX<=u && i*MIN+j*MAX>=l){A=i,B=j;i=a+1;break;}
    vector<int> r;
    int pos=0;
    for(int i=0;i<A;i++)r.pb(vec.at(pos++).second);
    pos = vec.size()-1;
    for(int i=0;i<B;i++)r.pb(vec.at(pos--).second);
    return r;
  }
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:30:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<w.size();i++)if(w[i]==MIN)a++;else b++;
                 ~^~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 5 ms 256 KB OK (n = 1, answer = YES)
4 Correct 5 ms 256 KB OK (n = 2, answer = YES)
5 Correct 4 ms 256 KB OK (n = 2, answer = YES)
6 Correct 4 ms 256 KB OK (n = 3, answer = YES)
7 Correct 4 ms 256 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 4 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 256 KB OK (n = 3, answer = YES)
11 Correct 4 ms 256 KB OK (n = 3, answer = YES)
12 Correct 5 ms 256 KB OK (n = 3, answer = YES)
13 Correct 4 ms 256 KB OK (n = 3, answer = NO)
14 Correct 4 ms 256 KB OK (n = 3, answer = YES)
15 Correct 4 ms 256 KB OK (n = 3, answer = YES)
16 Correct 4 ms 256 KB OK (n = 3, answer = NO)
17 Correct 4 ms 256 KB OK (n = 3, answer = NO)
18 Correct 5 ms 256 KB OK (n = 100, answer = NO)
19 Correct 5 ms 256 KB OK (n = 100, answer = YES)

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB OK (n = 12, answer = YES)
2 Correct 4 ms 256 KB OK (n = 12, answer = YES)
3 Correct 5 ms 256 KB OK (n = 12, answer = NO)
4 Correct 5 ms 384 KB OK (n = 12, answer = NO)
5 Correct 4 ms 256 KB OK (n = 12, answer = YES)
6 Correct 4 ms 256 KB OK (n = 12, answer = YES)
7 Correct 4 ms 256 KB OK (n = 12, answer = YES)
8 Correct 5 ms 384 KB OK (n = 12, answer = YES)
9 Correct 5 ms 256 KB OK (n = 6, answer = YES)
10 Correct 5 ms 256 KB OK (n = 12, answer = YES)
11 Correct 5 ms 256 KB OK (n = 100, answer = NO)
12 Incorrect 4 ms 256 KB sum of weights should be in [50..51] but it is 94
13 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 5 ms 256 KB OK (n = 1, answer = YES)
4 Correct 5 ms 256 KB OK (n = 2, answer = YES)
5 Correct 4 ms 256 KB OK (n = 2, answer = YES)
6 Correct 4 ms 256 KB OK (n = 3, answer = YES)
7 Correct 4 ms 256 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 4 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 256 KB OK (n = 3, answer = YES)
11 Correct 4 ms 256 KB OK (n = 3, answer = YES)
12 Correct 5 ms 256 KB OK (n = 3, answer = YES)
13 Correct 4 ms 256 KB OK (n = 3, answer = NO)
14 Correct 4 ms 256 KB OK (n = 3, answer = YES)
15 Correct 4 ms 256 KB OK (n = 3, answer = YES)
16 Correct 4 ms 256 KB OK (n = 3, answer = NO)
17 Correct 4 ms 256 KB OK (n = 3, answer = NO)
18 Correct 5 ms 256 KB OK (n = 100, answer = NO)
19 Correct 5 ms 256 KB OK (n = 100, answer = YES)
20 Correct 4 ms 384 KB OK (n = 12, answer = YES)
21 Correct 4 ms 256 KB OK (n = 12, answer = YES)
22 Correct 5 ms 256 KB OK (n = 12, answer = NO)
23 Correct 5 ms 384 KB OK (n = 12, answer = NO)
24 Correct 4 ms 256 KB OK (n = 12, answer = YES)
25 Correct 4 ms 256 KB OK (n = 12, answer = YES)
26 Correct 4 ms 256 KB OK (n = 12, answer = YES)
27 Correct 5 ms 384 KB OK (n = 12, answer = YES)
28 Correct 5 ms 256 KB OK (n = 6, answer = YES)
29 Correct 5 ms 256 KB OK (n = 12, answer = YES)
30 Correct 5 ms 256 KB OK (n = 100, answer = NO)
31 Incorrect 4 ms 256 KB sum of weights should be in [50..51] but it is 94
32 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 5 ms 256 KB OK (n = 1, answer = YES)
4 Correct 5 ms 256 KB OK (n = 2, answer = YES)
5 Correct 4 ms 256 KB OK (n = 2, answer = YES)
6 Correct 4 ms 256 KB OK (n = 3, answer = YES)
7 Correct 4 ms 256 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 4 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 256 KB OK (n = 3, answer = YES)
11 Correct 4 ms 256 KB OK (n = 3, answer = YES)
12 Correct 5 ms 256 KB OK (n = 3, answer = YES)
13 Correct 4 ms 256 KB OK (n = 3, answer = NO)
14 Correct 4 ms 256 KB OK (n = 3, answer = YES)
15 Correct 4 ms 256 KB OK (n = 3, answer = YES)
16 Correct 4 ms 256 KB OK (n = 3, answer = NO)
17 Correct 4 ms 256 KB OK (n = 3, answer = NO)
18 Correct 5 ms 256 KB OK (n = 100, answer = NO)
19 Correct 5 ms 256 KB OK (n = 100, answer = YES)
20 Correct 4 ms 384 KB OK (n = 12, answer = YES)
21 Correct 4 ms 256 KB OK (n = 12, answer = YES)
22 Correct 5 ms 256 KB OK (n = 12, answer = NO)
23 Correct 5 ms 384 KB OK (n = 12, answer = NO)
24 Correct 4 ms 256 KB OK (n = 12, answer = YES)
25 Correct 4 ms 256 KB OK (n = 12, answer = YES)
26 Correct 4 ms 256 KB OK (n = 12, answer = YES)
27 Correct 5 ms 384 KB OK (n = 12, answer = YES)
28 Correct 5 ms 256 KB OK (n = 6, answer = YES)
29 Correct 5 ms 256 KB OK (n = 12, answer = YES)
30 Correct 5 ms 256 KB OK (n = 100, answer = NO)
31 Incorrect 4 ms 256 KB sum of weights should be in [50..51] but it is 94
32 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 5 ms 256 KB OK (n = 1, answer = YES)
4 Correct 5 ms 256 KB OK (n = 2, answer = YES)
5 Correct 4 ms 256 KB OK (n = 2, answer = YES)
6 Correct 4 ms 256 KB OK (n = 3, answer = YES)
7 Correct 4 ms 256 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 4 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 256 KB OK (n = 3, answer = YES)
11 Correct 4 ms 256 KB OK (n = 3, answer = YES)
12 Correct 5 ms 256 KB OK (n = 3, answer = YES)
13 Correct 4 ms 256 KB OK (n = 3, answer = NO)
14 Correct 4 ms 256 KB OK (n = 3, answer = YES)
15 Correct 4 ms 256 KB OK (n = 3, answer = YES)
16 Correct 4 ms 256 KB OK (n = 3, answer = NO)
17 Correct 4 ms 256 KB OK (n = 3, answer = NO)
18 Correct 5 ms 256 KB OK (n = 100, answer = NO)
19 Correct 5 ms 256 KB OK (n = 100, answer = YES)
20 Correct 4 ms 384 KB OK (n = 12, answer = YES)
21 Correct 4 ms 256 KB OK (n = 12, answer = YES)
22 Correct 5 ms 256 KB OK (n = 12, answer = NO)
23 Correct 5 ms 384 KB OK (n = 12, answer = NO)
24 Correct 4 ms 256 KB OK (n = 12, answer = YES)
25 Correct 4 ms 256 KB OK (n = 12, answer = YES)
26 Correct 4 ms 256 KB OK (n = 12, answer = YES)
27 Correct 5 ms 384 KB OK (n = 12, answer = YES)
28 Correct 5 ms 256 KB OK (n = 6, answer = YES)
29 Correct 5 ms 256 KB OK (n = 12, answer = YES)
30 Correct 5 ms 256 KB OK (n = 100, answer = NO)
31 Incorrect 4 ms 256 KB sum of weights should be in [50..51] but it is 94
32 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 5 ms 256 KB OK (n = 1, answer = YES)
4 Correct 5 ms 256 KB OK (n = 2, answer = YES)
5 Correct 4 ms 256 KB OK (n = 2, answer = YES)
6 Correct 4 ms 256 KB OK (n = 3, answer = YES)
7 Correct 4 ms 256 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 4 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 256 KB OK (n = 3, answer = YES)
11 Correct 4 ms 256 KB OK (n = 3, answer = YES)
12 Correct 5 ms 256 KB OK (n = 3, answer = YES)
13 Correct 4 ms 256 KB OK (n = 3, answer = NO)
14 Correct 4 ms 256 KB OK (n = 3, answer = YES)
15 Correct 4 ms 256 KB OK (n = 3, answer = YES)
16 Correct 4 ms 256 KB OK (n = 3, answer = NO)
17 Correct 4 ms 256 KB OK (n = 3, answer = NO)
18 Correct 5 ms 256 KB OK (n = 100, answer = NO)
19 Correct 5 ms 256 KB OK (n = 100, answer = YES)
20 Correct 4 ms 384 KB OK (n = 12, answer = YES)
21 Correct 4 ms 256 KB OK (n = 12, answer = YES)
22 Correct 5 ms 256 KB OK (n = 12, answer = NO)
23 Correct 5 ms 384 KB OK (n = 12, answer = NO)
24 Correct 4 ms 256 KB OK (n = 12, answer = YES)
25 Correct 4 ms 256 KB OK (n = 12, answer = YES)
26 Correct 4 ms 256 KB OK (n = 12, answer = YES)
27 Correct 5 ms 384 KB OK (n = 12, answer = YES)
28 Correct 5 ms 256 KB OK (n = 6, answer = YES)
29 Correct 5 ms 256 KB OK (n = 12, answer = YES)
30 Correct 5 ms 256 KB OK (n = 100, answer = NO)
31 Incorrect 4 ms 256 KB sum of weights should be in [50..51] but it is 94
32 Halted 0 ms 0 KB -