Submission #223781

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
223781	2020-04-16 12:27:39	bharat2002	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	74 ms	8932 KiB

molecules

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
/*input
10 20
4
15 17 16 18
*/
#include "molecules.h"
#include<bits/stdc++.h>
using namespace std;
const int N=2e5 + 100;
const int mod=1e9 + 7;
#define pii pair<long long, int>
#define int long long
#define mp make_pair
#define f first
#define s second
int n;vector< pii > vals;
bool sf(pii a, pii b);long long pref[N];
vector<int> ans;int L, U;
void check(int num)
{
  if(pref[num-1]<=U)
  {
    for(int i=0;i<num;i++) ans.push_back(vals[i].s);return;
  }
  for(int i=num;i<n;i++)
  {
    if(pref[i]-pref[i-num]>=L&&pref[i]-pref[i-num]<=U)
    {
      for(int j=i-num+1;j<=i;j++) ans.push_back(vals[j].s);return;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

molecules.cpp:34:12: warning: extra tokens at end of #undef directive
 #undef int long long
            ^~~~
molecules.cpp:69:12: warning: extra tokens at end of #undef directive
 #undef int long long
            ^~~~
molecules.cpp: In function 'void check(long long int)':
molecules.cpp:24:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   for(int i=0;i<num;i++) ans.push_back(vals[i].s);return;
   ^~~
molecules.cpp:24:51: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   for(int i=0;i<num;i++) ans.push_back(vals[i].s);return;
                                                   ^~~~~~
molecules.cpp:30:4: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
    for(int j=i-num+1;j<=i;j++) ans.push_back(vals[j].s);return;
    ^~~
molecules.cpp:30:57: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
    for(int j=i-num+1;j<=i;j++) ans.push_back(vals[j].s);return;
                                                         ^~~~~~
molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:41:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<w.size();i++)
              ~^~~~~~~~~
molecules.cpp:47:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<vals.size();i++)
              ~^~~~~~~~~~~~
molecules.cpp:67:3: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   if(maxsum<l) continue;check(i);if(!ans.empty()) break;
   ^~
molecules.cpp:67:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   if(maxsum<l) continue;check(i);if(!ans.empty()) break;
                         ^~~~~
molecules.cpp:71:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<ans.size();i++) ret.push_back((int)ans[i]);
              ~^~~~~~~~~~~

• Subtask 1: 9 / 9
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 23 / 23
• Subtask 6: 31 / 31