CODE FESTIVAL 2016 Final

Submission #5376163

Source codeソースコード

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

/*BigInteger
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace xxx = boost::multiprecision;
using Bint = xxx::cpp_int;
using Real = xxx::number<xxx::cpp_dec_float<1024>>;
*/

#define int long long
#define pb(x) push_back(x)
#define m0(x) memset((x), 0LL, sizeof(x))
#define mm(x) memset((x), -1LL, sizeof(x))

//container
#define ALL(x) (x).begin(), (x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIsecondT(s, e) ((s).find(e) != (s).end())
#define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
#define PERM(c) \
  sort(ALL(c)); \
  for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))

// debug
#define GET_VAR_NAME(variable) #variable
#define test(x) cout << GET_VAR_NAME(x) << " = " << x << endl;

// bit_macro
#define Bit(n) (1LL << (n))
#define Bitset(a, b) (a) |= (1LL << (b))
#define Bitunset(a, b) (a) &= ~(1LL << (b))
#define Bitcheck(a, b) ((((a) >> (b)) & 1LL) == 1LL)
#define Bitcount(a) __builtin_popcountint((a))

//typedef
typedef long long lint;
typedef unsigned long long ull;
typedef complex<long double> Complex;
typedef pair<int, int> P;
typedef tuple<int, int, int> TP;
typedef vector<int> vec;
typedef vector<vec> mat;

//constant
constexpr int INF = (int)1e18;
constexpr int MOD = (int)1e9 + 7;
constexpr double PI = (double)acos(-1);
constexpr double EPsecond = (double)1e-10;
constexpr int dx[] = {-1, 0, 0, 1, 0, -1, -1, 1, 1};
constexpr int dy[] = {0, -1, 1, 0, 0, 1, -1, 1, -1};

//
template <typename T>
void chmax(T &a, T b) { a = max(a, b); }
template <typename T>
void chmin(T &a, T b) { a = min(a, b); }
//
inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T>
inline string tosecondtring(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}

//
struct Accelerate_Cin {
  Accelerate_Cin() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(20);
  };
} Accelerate_Cin;

signed main() {
  int n, m;
  cin >> n >> m;
  vector<P> cnt(100010);
  vector<int> pint(100010);
  for (int i = 0; i < n; i++) {
    int num;
    cin >> num;
    pint[num]++;
  }

  for (int i = 0; i < 100010; i++) {
    if (pint[i] > 0) {
      cnt[i % m].first += pint[i];
      cnt[i % m].second += pint[i] / 2;
    }
  }
  int ans = 0;
  ans += cnt[0].first / 2;
  for (int i = 1; i <= m / 2; i++) {

    if (i == m - i) {
      ans += cnt[i].first / 2;
    } else {
      ans += min(cnt[i].first, cnt[m - i].first);
      if (cnt[i].first > cnt[m - i].first) {
        ans += min(cnt[i].second, (cnt[i].first - cnt[m - i].first) / 2);
      } else {
        ans += min(cnt[m - i].second, (cnt[m - i].first - cnt[i].first) / 2);
      }
    }
  }
  cout << ans << endl;
  return 0;
}

Submission

Task問題 D - Pair Cards
User nameユーザ名 ぬるぬる
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 700
Source lengthソースコード長 3137 Byte
File nameファイル名
Exec time実行時間 11 ms
Memory usageメモリ使用量 2560 KB

Test case

Set

Set name Score得点 / Max score Cases
sample - sample-01.txt,sample-02.txt
all 700 / 700 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
01-01.txt AC 2 ms 2560 KB
01-02.txt AC 11 ms 2560 KB
01-03.txt AC 11 ms 2560 KB
01-04.txt AC 11 ms 2560 KB
01-05.txt AC 11 ms 2560 KB
01-06.txt AC 11 ms 2560 KB
01-07.txt AC 11 ms 2560 KB
01-08.txt AC 11 ms 2560 KB
01-09.txt AC 11 ms 2560 KB
01-10.txt AC 11 ms 2560 KB
01-11.txt AC 11 ms 2560 KB
01-12.txt AC 10 ms 2560 KB
01-13.txt AC 10 ms 2560 KB
01-14.txt AC 11 ms 2560 KB
01-15.txt AC 11 ms 2560 KB
01-16.txt AC 11 ms 2560 KB
01-17.txt AC 11 ms 2560 KB
01-18.txt AC 11 ms 2560 KB
01-19.txt AC 11 ms 2560 KB
01-20.txt AC 11 ms 2560 KB
01-21.txt AC 10 ms 2560 KB
01-22.txt AC 10 ms 2560 KB
01-23.txt AC 10 ms 2560 KB
01-24.txt AC 10 ms 2560 KB
01-25.txt AC 10 ms 2560 KB
01-26.txt AC 10 ms 2560 KB
01-27.txt AC 7 ms 2560 KB
01-28.txt AC 3 ms 2560 KB
01-29.txt AC 2 ms 2560 KB
01-30.txt AC 2 ms 2560 KB
sample-01.txt AC 2 ms 2560 KB
sample-02.txt AC 2 ms 2560 KB