oj.uz

Submission #725460

# Submission time Handle Problem Language Result Execution time Memory
725460 2023-04-17T13:23:10 Z browntoad Olympiads (BOI19_olympiads) C++14
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pip pair<int, pii>
#define pdd pair<double ,double>
#define pcc pair<char, char>
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif

const ll inf = 1ll<<60;
const ll iinf = 2147483647;
const ll mod = 1e9+7;
const ll maxn=2e5+5;
const ll maxm=105;
const double PI=acos(-1);

ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}

ll inv(ll a, ll m=mod){
    return pw(a,m-2,m);
}

int n, k, c;
struct pp{
    int arr[6];
};
struct tup{
    int val;
    vector<int> cho; // size k
    int cid;
    bool operator < (const tup &b)const{
        return val>b.val;
    }
};
vector<int> opt(tup &cur){
    vector<int> ret;
    REP(i, cur.val){
        ret.pb(cur.cho[i]);
    }
    REP(i, k){

    }
}
signed main(){
    IOS();
    cin>>n>>k>>c;
    priority_queue<tup> pq;
}
/*
5
1 2 1 2 2
6
2 4
*/

Compilation message

olympiads.cpp: In function 'std::vector<long long int> opt(tup&)':
olympiads.cpp:75:1: warning: no return statement in function returning non-void [-Wreturn-type]
   75 | }
      | ^

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -