Submission #3363811


Source Code Expand

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

#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
//const ll mod = 1000000007;

int main() {
    //cout.precision(10);
    int n, m;
    cin >> n >> m;
    map<int, int> mp;
    for(int i = 0; i <= 100000; i++){
        mp[i] = 0;
    }
    for(int i = 1; i <= n; i++){
        int in;
        cin >> in;
        mp[in]++;
    }
    int odds[100500];
    int evens[100500];
    for(int i = 0; i <= 100000; i++){
        odds[i] = 0;
        evens[i] = 0;
    }
    for(int i = 1; i <= 100000; i++){
        int number = i % m;
        evens[number] += (mp[i] / 2) * 2;
        if(mp[i] % 2 == 1){
            odds[number]++;
        }
    }
    int ans = 0;
    //for(int i = 1; i <= 1; i++){
    for(int i = 1; i * 2 < m; i++){
        int number = min(odds[i], odds[m - i]);
        ans += number;
        odds[i] -= number;
        odds[m - i] -= number;
        //cout << ans << endl;
        number = min(odds[i], evens[m - i]);
        ans += number;
        //cout << ans << endl;
        odds[i] -= number;
        evens[m - i] -= number;
        number = min(evens[i], odds[m - i]);
        ans += number;
        //cout << ans << endl;
        evens[i] -= number;
        odds[m - i] -= number;
        ans += evens[i] / 2;
        ans += evens[m - i] / 2;
        //cout << i << " " << ans << endl;
    }
    ans += odds[0] / 2;
    evens[0] += (odds[0] % 2);
    ans += evens[0] / 2;
    if(m % 2 == 0){
        int check = m / 2;
        ans += odds[check] / 2;
        evens[check] += (evens[check] % 2);
        ans += evens[check] / 2;
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Submission Time
Task D - Pair Cards
User kort0n
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1746 Byte
Status AC
Exec Time 106 ms
Memory 5760 KB

Judge Result

Set Name sample all
Score / Max Score 0 / 0 700 / 700
Status
AC × 2
AC × 34
Set Name Test Cases
sample sample-01.txt, sample-02.txt
all sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, sample-01.txt, sample-02.txt
Case Name Status Exec Time Memory
01-01.txt AC 44 ms 5760 KB
01-02.txt AC 104 ms 5760 KB
01-03.txt AC 104 ms 5760 KB
01-04.txt AC 103 ms 5760 KB
01-05.txt AC 103 ms 5760 KB
01-06.txt AC 103 ms 5760 KB
01-07.txt AC 103 ms 5760 KB
01-08.txt AC 102 ms 5760 KB
01-09.txt AC 106 ms 5760 KB
01-10.txt AC 103 ms 5760 KB
01-11.txt AC 103 ms 5760 KB
01-12.txt AC 78 ms 5760 KB
01-13.txt AC 78 ms 5760 KB
01-14.txt AC 102 ms 5760 KB
01-15.txt AC 104 ms 5760 KB
01-16.txt AC 102 ms 5760 KB
01-17.txt AC 103 ms 5760 KB
01-18.txt AC 101 ms 5760 KB
01-19.txt AC 103 ms 5760 KB
01-20.txt AC 104 ms 5760 KB
01-21.txt AC 102 ms 5760 KB
01-22.txt AC 98 ms 5760 KB
01-23.txt AC 98 ms 5760 KB
01-24.txt AC 102 ms 5760 KB
01-25.txt AC 101 ms 5760 KB
01-26.txt AC 101 ms 5760 KB
01-27.txt AC 70 ms 5760 KB
01-28.txt AC 46 ms 5760 KB
01-29.txt AC 44 ms 5760 KB
01-30.txt AC 43 ms 5760 KB
sample-01.txt AC 44 ms 5760 KB
sample-02.txt AC 44 ms 5760 KB