Submission #471349

#	Time	Username	Problem	Language	Result	Execution time	Memory
471349		NhatMinh0208	CONSUL (info1cup19_consul)	C++14	100 / 100	79 ms	256 KiB

consul

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif

#include "grader.h"

vector<int> vec;
vector<pii(int)> vec2;
map<int,int> lmao;
void solve(int n) {
    int m=0,i=0,j=0,k=0,t=0,t1=0,u=0,v=0,a=0,b=0;
    
    int NUM_INT = 52, NUM_CNT = 8;
    if (n<=50) {
        NUM_INT = 44;
        NUM_CNT = 6;
    } 
    vec.clear();
    lmao.clear();
    for (i=0;i<n;i++) vec.push_back(i+1);
    random_shuffle(vec.begin(),vec.end());
    for (i=0;i<min(NUM_INT,vec.size());i++) {
        u = kth(vec[i]);
        lmao[u]++;
    }
    vec2.clear();
    for (auto g : lmao) vec2.push_back({g.se,g.fi});
    sort(vec2.begin(),vec2.end());
    for (i=1;i<=min(NUM_CNT,vec2.size());i++) {
        u = cnt(vec2[vec2.size()-i].se);
        if (u*3>n) {
            say_answer(vec2[vec2.size()-i].se);
            return;
        }
    }
    say_answer(-1);
    return ;
}
// Normie28;

Compilation message (stderr)

consul.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      | 
consul.cpp: In function 'void solve(int)':
consul.cpp:41:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 | #define min(a,b) (((a)<(b))?(a):(b))
      |                    ~~~^~~~
consul.cpp:118:16: note: in expansion of macro 'min'
  118 |     for (i=0;i<min(NUM_INT,vec.size());i++) {
      |                ^~~
consul.cpp:118:15: warning: comparison of integer expressions of different signedness: 'int' and 'long unsigned int' [-Wsign-compare]
  118 |     for (i=0;i<min(NUM_INT,vec.size());i++) {
      |               ^
consul.cpp:41:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 | #define min(a,b) (((a)<(b))?(a):(b))
      |                    ~~~^~~~
consul.cpp:125:17: note: in expansion of macro 'min'
  125 |     for (i=1;i<=min(NUM_CNT,vec2.size());i++) {
      |                 ^~~
consul.cpp:125:15: warning: comparison of integer expressions of different signedness: 'int' and 'long unsigned int' [-Wsign-compare]
  125 |     for (i=1;i<=min(NUM_CNT,vec2.size());i++) {
      |               ^
consul.cpp:107:9: warning: unused variable 'm' [-Wunused-variable]
  107 |     int m=0,i=0,j=0,k=0,t=0,t1=0,u=0,v=0,a=0,b=0;
      |         ^
consul.cpp:107:17: warning: unused variable 'j' [-Wunused-variable]
  107 |     int m=0,i=0,j=0,k=0,t=0,t1=0,u=0,v=0,a=0,b=0;
      |                 ^
consul.cpp:107:21: warning: unused variable 'k' [-Wunused-variable]
  107 |     int m=0,i=0,j=0,k=0,t=0,t1=0,u=0,v=0,a=0,b=0;
      |                     ^
consul.cpp:107:25: warning: unused variable 't' [-Wunused-variable]
  107 |     int m=0,i=0,j=0,k=0,t=0,t1=0,u=0,v=0,a=0,b=0;
      |                         ^
consul.cpp:107:29: warning: unused variable 't1' [-Wunused-variable]
  107 |     int m=0,i=0,j=0,k=0,t=0,t1=0,u=0,v=0,a=0,b=0;
      |                             ^~
consul.cpp:107:38: warning: unused variable 'v' [-Wunused-variable]
  107 |     int m=0,i=0,j=0,k=0,t=0,t1=0,u=0,v=0,a=0,b=0;
      |                                      ^
consul.cpp:107:42: warning: unused variable 'a' [-Wunused-variable]
  107 |     int m=0,i=0,j=0,k=0,t=0,t1=0,u=0,v=0,a=0,b=0;
      |                                          ^
consul.cpp:107:46: warning: unused variable 'b' [-Wunused-variable]
  107 |     int m=0,i=0,j=0,k=0,t=0,t1=0,u=0,v=0,a=0,b=0;
      |                                              ^

• Subtask 1: 15 / 15
• Subtask 2: 20 / 20
• Subtask 3: 65 / 65