Submission #993521


Source Code Expand

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#define F first
#define S second
using namespace std;
int n,m;
int x[111111];
int a[111111];
int main(void){
  scanf("%d%d",&n,&m);
  for(int i = 0; i < n; i++){
    scanf("%d",x+i);
    a[x[i]]++;
  }


  int sum = 0;
  for(int i = 1; i*2 <= m; i++){
    int ag = 0;
    int ak = 0;
    int bg = 0;
    int bk = 0;
    int b = (m-i);
    for(int j = 0; max(i,b)+m*j < 111111;  j++){
      ag += a[i+m*j]/2;
      ak += a[i+m*j]%2;
      bg += a[b+m*j]/2;
      bk += a[b+m*j]%2;
    }
    /*
    printf("a %d b %d\n",i,b);
    printf("ak %d bk %d\n",ak,bk);
    printf("ag %d bg %d\n",ag,bg);
    */

    if(i != b){
      sum += min(ak,bk);
      if(ak > bk){
	bk = 0;
	ak -= min(ak,bk);
	int kk = min(ak/2,bg);
	sum += kk*2;
	ak -= kk*2;
	bg -= kk;
      }
      if(ak < bk){
	ak = 0;
	bk -= min(ak,bk);
	int kk = min(bk/2,ag);
	sum += kk*2;
	bk -= kk*2;
	ag -= kk;
      }
      sum += ag+bg;
      //qprintf("sum %d\n",sum);
    }else{
      sum += ak/2 + ag;
      //printf("sum %d\n",sum);
    }
  }
  int ggg = 0;
  int kkk = 0;
  for(int i = 1; m*i < 111111; i++){
    ggg += a[m*i]/2;
    kkk += a[m*i]%2;
  }
  sum += kkk/2 + ggg;


  printf("%d\n",sum);
}

Submission Info

Submission Time
Task D - Pair Cards
User gotto
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1429 Byte
Status WA
Exec Time 13 ms
Memory 1152 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:18:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&n,&m);
                      ^
./Main.cpp:20:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",x+i);
                    ^

Judge Result

Set Name sample all
Score / Max Score 0 / 0 0 / 700
Status
AC × 2
AC × 21
WA × 11
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 3 ms 256 KB
01-02.txt AC 13 ms 1024 KB
01-03.txt AC 13 ms 1024 KB
01-04.txt WA 13 ms 1024 KB
01-05.txt WA 13 ms 1024 KB
01-06.txt WA 13 ms 1024 KB
01-07.txt WA 13 ms 1024 KB
01-08.txt WA 13 ms 1024 KB
01-09.txt WA 13 ms 1024 KB
01-10.txt WA 13 ms 1024 KB
01-11.txt AC 13 ms 1024 KB
01-12.txt AC 13 ms 640 KB
01-13.txt AC 13 ms 640 KB
01-14.txt AC 13 ms 1024 KB
01-15.txt AC 13 ms 1024 KB
01-16.txt AC 13 ms 1024 KB
01-17.txt AC 13 ms 1024 KB
01-18.txt AC 13 ms 1024 KB
01-19.txt AC 13 ms 1152 KB
01-20.txt AC 13 ms 1024 KB
01-21.txt AC 13 ms 1024 KB
01-22.txt WA 13 ms 1024 KB
01-23.txt WA 13 ms 1024 KB
01-24.txt WA 13 ms 1024 KB
01-25.txt WA 13 ms 1024 KB
01-26.txt AC 13 ms 1024 KB
01-27.txt AC 8 ms 640 KB
01-28.txt AC 4 ms 640 KB
01-29.txt AC 3 ms 640 KB
01-30.txt AC 3 ms 256 KB
sample-01.txt AC 3 ms 256 KB
sample-02.txt AC 3 ms 256 KB