Submission #993016
Source Code Expand
// need
#include <iostream>
#include <algorithm>
// data structure
//#include <bitset>
//#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <array>
//#include <tuple>
//#include <unordered_map>
//#include <unordered_set>
//#include <complex>
//#include <deque>
// stream
//#include <istream>
//#include <sstream>
//#include <ostream>
// etc
//#include <cassert>
#include <functional>
#include <iomanip>
//#include <typeinfo>
//#include <chrono>
//#include <random>
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__);
template<typename T> void Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void Scan(First& first, Rest&...rest) { std::cin >> first; Scan(rest...); }
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define PAIR std::pair<int, int>
#define PAIRLL std::pair<ll, ll>
#define IN(a, x, b) (a<=x && x<b)
#define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWPAIR(p) {std::cerr << #p << "\t:(" << p.first << ",\t" << p.second << ")\n";}
#define SHOWPAIRVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr<<'('<<yyy.first<<", "<<yyy.second<<") ";}std::cerr << "\n";}}
#define SHOWPAIRVECTOR(v) {for(const auto& xxx:v){std::cerr<<'('<<xxx.first<<", "<<xxx.second<<") ";}std::cerr<<"\n";}
#define SHOWQUEUE(a) {std::queue<decltype(a.front())> tmp(a);std::cerr << #a << "\t:";for(int i=0; i<static_cast<int>(a.size()); ++i){std::cerr << tmp.front() << "\n";tmp.pop();}std::cerr << "\n";}
//#define CHMAX(a, b) a = (((a)<(b)) ? (b) : (a))
//#define CHMIN(a, b) a = (((a)>(b)) ? (b) : (a))
template<typename T> T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<typename T> T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
//void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns (" << res / (1.0e9) << "s)]\n"; }
#define int ll
using ll = long long;
using ull = unsigned long long;
constexpr int INFINT = 1 << 30; // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60; // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^19
constexpr double EPS = 1e-9;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238;
signed main() {
INIT;
VAR(int, n, m);
VEC(int, x, n);
std::vector<int> cnt(100005, 0);
std::vector<int> mai(m, 0);
std::vector<int> pair(m, 0);
REP(i, n) {
++cnt[x[i]];
}
REP(i, n) {
++mai[x[i]%m];
}
REP(i, 100005) {
pair[i%m] += (cnt[i]/2)*2;
}
//SHOWVECTOR(mai);
//SHOWVECTOR(pair);
int ans = 0;
ans += mai[0] / 2;
FOR(i, 1, (m - 1) / 2 + 1) {
int min = std::min(mai[i], mai[m - i]);
ans += min;
int t1 = mai[i] - min;
ans += std::min(t1, pair[i]) / 2;
int t2 = mai[m - i] - min;
ans += std::min(t2, pair[m - i]) / 2;
}
if(m%2==0) ans += mai[m/2] / 2;
OUT(ans)BR;
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Pair Cards |
User |
satanic0258 |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
4798 Byte |
Status |
AC |
Exec Time |
17 ms |
Memory |
3456 KB |
Judge Result
Set Name |
sample |
all |
Score / Max Score |
0 / 0 |
700 / 700 |
Status |
|
|
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 |
Case Name |
Status |
Exec Time |
Memory |
01-01.txt |
AC |
5 ms |
1024 KB |
01-02.txt |
AC |
14 ms |
1792 KB |
01-03.txt |
AC |
14 ms |
1792 KB |
01-04.txt |
AC |
14 ms |
1792 KB |
01-05.txt |
AC |
14 ms |
1792 KB |
01-06.txt |
AC |
14 ms |
1792 KB |
01-07.txt |
AC |
14 ms |
1920 KB |
01-08.txt |
AC |
14 ms |
1792 KB |
01-09.txt |
AC |
14 ms |
1792 KB |
01-10.txt |
AC |
16 ms |
2432 KB |
01-11.txt |
AC |
17 ms |
3328 KB |
01-12.txt |
AC |
14 ms |
1792 KB |
01-13.txt |
AC |
15 ms |
2560 KB |
01-14.txt |
AC |
14 ms |
1792 KB |
01-15.txt |
AC |
14 ms |
1792 KB |
01-16.txt |
AC |
14 ms |
1792 KB |
01-17.txt |
AC |
14 ms |
1792 KB |
01-18.txt |
AC |
14 ms |
1920 KB |
01-19.txt |
AC |
15 ms |
2048 KB |
01-20.txt |
AC |
16 ms |
3456 KB |
01-21.txt |
AC |
14 ms |
1792 KB |
01-22.txt |
AC |
14 ms |
1792 KB |
01-23.txt |
AC |
14 ms |
1792 KB |
01-24.txt |
AC |
14 ms |
1792 KB |
01-25.txt |
AC |
15 ms |
2304 KB |
01-26.txt |
AC |
16 ms |
3328 KB |
01-27.txt |
AC |
11 ms |
3072 KB |
01-28.txt |
AC |
7 ms |
2688 KB |
01-29.txt |
AC |
5 ms |
1664 KB |
01-30.txt |
AC |
6 ms |
2560 KB |
sample-01.txt |
AC |
5 ms |
1024 KB |
sample-02.txt |
AC |
5 ms |
1024 KB |