Submission #1151482

#TimeUsernameProblemLanguageResultExecution timeMemory
1151482KluydQCONSUL (info1cup19_consul)C++20
Compilation error
0 ms0 KiB
#include <bits/stdc++.h> #include "grader.h" #define respagold ios_base::sync_with_stdio(0), cin.tie(0); #define int long long #define ll long long #define int2 __int128_t #define FOR( i, x, n, d ) for( int i = x; i <= n; i += d ) #define FORR( i, x, n, d ) for( int i = x; i >= n; i -= d ) #define F first #define S second #define all(x) x.begin(), x.end() #define sz(x) (int)(x.size()) #define pb push_back #define ins insert #define lb lower_bound #define ub upper_bound #define pii pair <int, int> #define mkp make_pair using namespace std; const int N = 2e5 + 123; const int inf = 1e18; const int MOD = 1e9 + 7; const int MOD1 = 998244353; const int P = 6547; const int lo = 1e15; int a[N], b[N], c[N], d[N], n, m, k, z, w, ans, x, y; vector <int> g[N]; mt19937 rng( chrono::steady_clock::now().time_since_epoch().count()); int rand( int l, int r ) { uniform_int_distribution <int> uid( l, r ); return uid( rng ); } void solve( int n ) { int num = min( n, 30ll ); FOR( i, 1, n, 1 ) a[i] = i; random_shuffle( a + 1, a + n + 1 ); int ans = -1; FOR( i, 1, num, 1 ) { x = kth(a[i]); y = cnt(x); if( y > n / 3 ) ans = x; } say_answer(ans); } signed main() { // freopen("connect.in", "r", stdin); // freopen("connect.out", "w", stdout); respagold int test = 0; if( !test ) cin >> test; while( test -- ) { solve(); } } // solved by KluydQ

Compilation message (stderr)

consul.cpp: In function 'int main()':
consul.cpp:70:22: error: no matching function for call to 'solve()'
   70 |                 solve();
      |                 ~~~~~^~
In file included from consul.cpp:2:
grader.h:5:6: note: candidate: 'void solve(int)'
    5 | void solve(int n);
      |      ^~~~~
grader.h:5:6: note:   candidate expects 1 argument, 0 provided
consul.cpp:40:6: note: candidate: 'void solve(long long int)'
   40 | void solve( int n )
      |      ^~~~~
consul.cpp:40:6: note:   candidate expects 1 argument, 0 provided