Submission #924525

#	Time	Username	Problem	Language	Result	Execution time	Memory
924525		Webbly	Detecting Molecules (IOI16_molecules)	C++17	Compilation error	0 ms	0 KiB

molecules

// Problem: A. ��� ��������
// Contest: Codeforces - EDLIGHT CAMP IOI #1
// URL: https://codeforces.com/group/3wt9BX8ZwP/contest/500376/problem/0
// Memory Limit: 256 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
//
//                  Solution
//                    Webbly, 27.01.2023
//
//
//                    Arsen ne katai
//
//
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////



#include<bits/stdc++.h>
#include "molecules.h"
/**
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include <map>
#include <set>
#include <time.h>
*/
//#pragma GCC optimize("O3")
//#pragma GCC optimize("fast-loops")
/**
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC target("avx")
*/
#define ll long long
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define flush cout.flush()

using namespace std;

const ll mod = (ll)1e9 + 7, mod3 = 998244353, inf = (ll)2e16, P = 31;

ll rnd(){
    ll x = rand();

    return rand() ^ x;
}

ll binpow (ll a, ll b){
    ll ans = 1;
    while(b){
        if (b & 1){
            ans *= a;

            ans %= mod;
        }

        b >>= 1;
        a *= a;

        a %= mod;
    }
    return ans;
}
ll gcd(ll a, ll b){
    return (b ? gcd(b, a % b) : a);
}
ll lcm(ll a, ll b){
    return a / gcd(a, b) * b;
}

struct tr{
    ll four, seven, inc, dec;
};

struct T{
    ll x, ind;
};

ll n, m, k b[500005], p[500005];

T q[500005];

vector <ll> find_subset(ll l, ll r, vector <ll> w){
	n = w.size();
	
	for (ll i = 0; i < n; i++){
		q[i + 1] = {a[i], i};
	}
	
	sort (q + 1, q + n + 1, [](T a, T b){
		return a.x < b.x;
	});
	
	for (ll i = 1; i <= n; i++) p[i] = p[i - 1] + q[i].x;
	
	ll l = 1;
	
	vector <ll> ans;
	
	for (ll i = 1; i <= n; i++){
		while((p[i] - p[l - 1] > r || p[i] - p[l - 1] < l) && l <= i) l++;
		
		if (l <= i){
			for (ll j = l; j <= i; j++) ans.pb(q[j].ind);
			
			return ans;
		}
	}
	
	return ans;
}
/**

3 9 15 21 27 33 39 45

5 25 35 55 65 85 95


*/

Compilation message (stderr)

molecules.cpp:126:12: error: expected initializer before 'b'
  126 | ll n, m, k b[500005], p[500005];
      |            ^
molecules.cpp: In function 'std::vector<long long int> find_subset(long long int, long long int, std::vector<long long int>)':
molecules.cpp:134:15: error: 'a' was not declared in this scope
  134 |   q[i + 1] = {a[i], i};
      |               ^
molecules.cpp:134:22: error: no match for 'operator=' (operand types are 'T' and '<brace-enclosed initializer list>')
  134 |   q[i + 1] = {a[i], i};
      |                      ^
molecules.cpp:122:8: note: candidate: 'constexpr T& T::operator=(const T&)'
  122 | struct T{
      |        ^
molecules.cpp:122:8: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const T&'
molecules.cpp:122:8: note: candidate: 'constexpr T& T::operator=(T&&)'
molecules.cpp:122:8: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'T&&'
molecules.cpp:141:30: error: 'p' was not declared in this scope
  141 |  for (ll i = 1; i <= n; i++) p[i] = p[i - 1] + q[i].x;
      |                              ^
molecules.cpp:143:5: error: declaration of 'long long int l' shadows a parameter
  143 |  ll l = 1;
      |     ^
molecules.cpp:130:28: note: 'long long int l' previously declared here
  130 | vector <ll> find_subset(ll l, ll r, vector <ll> w){
      |                            ^
molecules.cpp:148:10: error: 'p' was not declared in this scope
  148 |   while((p[i] - p[l - 1] > r || p[i] - p[l - 1] < l) && l <= i) l++;
      |          ^