Submission #36434944

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

long long a[200100],s[200100],c[200100];
long long f[200100];
int num;

int main()
{
    int n,m;
    long long ans=1e16,sum=0;

    cin>>n>>m;
    for(int i=0; i<n; i++)
    scanf("%lld", &a[i]), sum+=a[i], s[i]=a[i];

    sort(s, s+n);
    int num=unique(s, s+n)-s;
    for(int i=0; i<n; i++)
    ++c[lower_bound(s, s+num, a[i])-s];
    for(int i=0; i<num*2; i++)
    {
        if(s[i%num]==(s[(i-1+num)%num]+1)%m)
        f[i%num]=min(f[(i-1+num)%num]+s[i%num]*c[i%num], sum);
        else
        f[i%num]=s[i%num]*c[i%num];
    }

    for(int i=0; i<num; i++)
    ans=min(ans, sum-f[i]);
    cout<<ans;
    return 0;
}

Submission Info

Submission Time
Task D - Takahashi's Solitaire
User LingChen
Language C++ (GCC 9.2.1)
Score 400
Code Size 701 Byte
Status AC
Exec Time 80 ms
Memory 9976 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:15:10: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   15 |     scanf("%lld", &a[i]), sum+=a[i], s[i]=a[i];
      |     ~~~~~^~~~~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 40
Set Name Test Cases
Sample example0.txt, example1.txt, example2.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, example0.txt, example1.txt, example2.txt
Case Name Status Exec Time Memory
000.txt AC 6 ms 3732 KiB
001.txt AC 31 ms 6720 KiB
002.txt AC 31 ms 6752 KiB
003.txt AC 74 ms 9812 KiB
004.txt AC 72 ms 9820 KiB
005.txt AC 71 ms 9976 KiB
006.txt AC 73 ms 9700 KiB
007.txt AC 38 ms 6736 KiB
008.txt AC 29 ms 6704 KiB
009.txt AC 26 ms 6708 KiB
010.txt AC 6 ms 3680 KiB
011.txt AC 39 ms 6432 KiB
012.txt AC 70 ms 9556 KiB
013.txt AC 76 ms 9972 KiB
014.txt AC 74 ms 9720 KiB
015.txt AC 76 ms 9812 KiB
016.txt AC 76 ms 9808 KiB
017.txt AC 79 ms 9840 KiB
018.txt AC 78 ms 9856 KiB
019.txt AC 31 ms 6704 KiB
020.txt AC 39 ms 6700 KiB
021.txt AC 43 ms 6752 KiB
022.txt AC 53 ms 6880 KiB
023.txt AC 66 ms 8048 KiB
024.txt AC 76 ms 9976 KiB
025.txt AC 74 ms 9716 KiB
026.txt AC 73 ms 9848 KiB
027.txt AC 76 ms 9700 KiB
028.txt AC 76 ms 9712 KiB
029.txt AC 76 ms 9872 KiB
030.txt AC 77 ms 9872 KiB
031.txt AC 75 ms 9724 KiB
032.txt AC 72 ms 9612 KiB
033.txt AC 76 ms 9852 KiB
034.txt AC 77 ms 9840 KiB
035.txt AC 76 ms 9840 KiB
036.txt AC 80 ms 9828 KiB
example0.txt AC 3 ms 3476 KiB
example1.txt AC 2 ms 3476 KiB
example2.txt AC 2 ms 3584 KiB