Submission #1110218

#	Time	Username	Problem	Language	Result	Execution time	Memory
1110218		vjudge1	Ski 2 (JOI24_ski2)	C++17	0 / 100	1 ms	336 KiB

Main

#include <bits/stdc++.h>
#define fi(i, a, b) for( int i = a; i <= b; i++ )
#define fid(i, a, b) for( int i = a; i >= b; i-- )
#define getbit(x, i) ((x>>i)&1)
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define pli pair<ll,int>
#define pll pair<ll,ll>
#define st first
#define nd second
#define mp make_pair
#define HTManh ""
#define maxn 100009
#define endl '\n'
using namespace std;

int n;
ll k;
pll a[309];

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(NULL); cout.tie(NULL);
	if (fopen(HTManh".inp", "r"))
    {
        freopen(HTManh".inp", "r", stdin);
        freopen(HTManh".out", "w", stdout);
    }

    cin >> n >> k;
    fi(i,1,n) cin >> a[i].st >> a[i].nd;
    sort(a+1,a+n+1);

    int vt = 0;
    fi(i,1,n) if (a[i].st != a[1].st)
    {
        vt = i-1;
        break;
    }
    ll res = 0;
    fi(i,2,vt)
    {
        a[i].st = a[1].st + 1;
        res += k;
    }

    int pre = 1;
    int dau = n, cuoi = n;
    while(dau > 0)
    {
        while(a[dau].st == a[cuoi].st && dau > 0) dau--;
        dau++;

        ll mn = 1e18;
        fi(i,dau,cuoi) mn = min(mn, a[i].nd);
        res += 1ll*mn*(pre-1);


        pre = cuoi-dau+1;

        cuoi = dau - 1;
        dau = cuoi;
    }
    cout << res << endl;

}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:28:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |         freopen(HTManh".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:29:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |         freopen(HTManh".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 12
• Subtask 3: 0 / 9
• Subtask 4: 0 / 33
• Subtask 5: 0 / 27
• Subtask 6: 0 / 14