Submission #252750

#	Time	Username	Problem	Language	Result	Execution time	Memory
252750		leaked	Go (COCI18_go)	C++14	100 / 100	26 ms	31616 KiB

go

#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
//    #pragma GCC optimize("unroll-loops")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cout << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cout << endl; }
eni(!=) cout << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (int)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
const char rev_to[4]={'E','W','N','S'};
const int N=2e6+1;
const int M=1e9+7;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
auto rnd=bind(uniform_int_distribution<ll>(1,125),mt19937(time(0)));
void bad(){
    cout<<-1;
    exit(0);
}
bool cmp(pll a,pll b){
    return (a.f!=b.f ? a.f>b.f : a.s<b.s);
}
struct stuff{
    int a=0,b=0,time=0,id;

};
stuff lol[N];
signed main()
{
    fast_io;
    int n,k,m;
    cin>>n>>k>>m;
    vector<stuff>a(m);
    for(auto &z : a) cin>>z.a>>z.b>>z.time,lol[z.a]=z;
    int ans=-2e9;
    for(int i=0;i<m;i++){
        for(int j=0;j<m;j++){
            if(i==j || (a[i].a<=k)!=(a[j].a<=k)) 1;
            else continue;
            vector<bool>used(n+1,0);
            int s=lol[k].b;
            int t=k,realtime=0;
            while(t!=a[i].a){
                if(a[i].a<t) t--;
                else t++;
                realtime++;
                if(lol[t].time>realtime && !used[t]){
                    s+=lol[t].b;
                    used[t]=1;
                }
//                debug()<<imie(t)imie(lol[t].time)<<imie(lol[t].b);
            }
            realtime*=2;
            t=k;
            if(i==j) t=a[j].a,realtime/=2;
            while(t!=a[j].a){
                if(a[j].a<t) t--;
                else t++;
                realtime++;
                if(lol[t].time>realtime && !used[t]){
                    s+=lol[t].b;used[t]=1;
                }
//                debug()<<imie(t)imie(lol[t].time)<<imie(lol[t].b);
            }
            int rl=realtime,need=1,ss=s;
            while(t!=need){
                if(need<t) t--;
                else t++;
                realtime++;
                if(lol[t].time>realtime && !used[t]){
                    s+=lol[t].b;used[t]=1;
                }
//                debug()<<imie(t)imie(lol[t].time)<<imie(lol[t].b);
            }
//            debug()<<imie(i)<<imie(j)<<imie(s);
            ans=max(ans,s);
            s=ss;realtime=rl;
            need=n;
            t=a[j].a;
            while(t!=need){
                if(need<t) t--;
                else t++;
                realtime++;
                if(lol[t].time>realtime && !used[t]){
                    s+=lol[t].b;used[t]=1;
                }
//                debug()<<imie(t)imie(lol[t].time)<<imie(lol[t].b);
            }
            ans=max(ans,s);

        }
    }
    cout<<ans;
    return 0;
}
/*
1
7
1 2 4 8 131 64 128
1
100000000000 100000000000
*/

Compilation message (stderr)

go.cpp: In function 'int main()':
go.cpp:104:51: warning: statement has no effect [-Wunused-value]
             if(i==j || (a[i].a<=k)!=(a[j].a<=k)) 1;
                                                   ^

• Subtask 1: 100 / 100