Submission #5017418
Source Code Expand
#include<bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fin(x) freopen(x,"r",stdin)
#define fout(x) freopen(x,"w",stdout)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll inf=0xc0c0c0c0c0c0c0c0;
const double pi=acos(-1);
const int MAXM=1e5+7;
typedef map<int,int>::iterator IT;
int N,M,cnt;
map<int,int> tool[MAXM];
int odd[MAXM],pir[MAXM];
void solve(int a,int b)
{
if(odd[a]>odd[b])
{
swap(odd[a],odd[b]);
swap(pir[a],pir[b]);
}
int left=odd[b]-odd[a];
int k=min(left>>1,pir[a]);
odd[a]+=k<<1;
pir[a]-=k;
cnt+=odd[a];
cnt+=pir[b]+pir[a];
}
void solve(int x)
{
cnt+=pir[x];
cnt+=odd[x]>>1;
}
int main()
{
scanf("%d%d",&N,&M);
for(int i=0;i<N;i++)
{
int x;
scanf("%d",&x);
tool[x%M][x]++;
}
for(int i=0;i<M;i++)
{
for(IT it=tool[i].begin();it!=tool[i].end();it++)
{
pir[i]+=it->se>>1;
if(it->se&1)
{
it->se--;
odd[i]++;
}
}
}
cnt=0;
solve(0);
if((M&1)==0)solve(M>>1);
for(int i=1;i<=((M-1)>>1);i++)
solve(i,M-i);
printf("%d",cnt);
return 0;
}
Submission Info
Submission Time
2019-04-18 20:03:05+0900
Task
D - Pair Cards
User
vjudge2
Language
C++14 (GCC 5.4.1)
Score
700
Code Size
1162 Byte
Status
AC
Exec Time
48 ms
Memory
10368 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:42:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&N,&M);
^
./Main.cpp:46:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&x);
^
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, sample-01.txt, sample-02.txt
Case Name
Status
Exec Time
Memory
01-01.txt
AC
3 ms
4992 KB
01-02.txt
AC
41 ms
7936 KB
01-03.txt
AC
41 ms
7936 KB
01-04.txt
AC
41 ms
7936 KB
01-05.txt
AC
40 ms
7936 KB
01-06.txt
AC
40 ms
7936 KB
01-07.txt
AC
39 ms
7936 KB
01-08.txt
AC
35 ms
7936 KB
01-09.txt
AC
32 ms
7936 KB
01-10.txt
AC
25 ms
8192 KB
01-11.txt
AC
22 ms
8704 KB
01-12.txt
AC
13 ms
4992 KB
01-13.txt
AC
13 ms
5120 KB
01-14.txt
AC
48 ms
9600 KB
01-15.txt
AC
47 ms
9600 KB
01-16.txt
AC
45 ms
9600 KB
01-17.txt
AC
42 ms
9600 KB
01-18.txt
AC
38 ms
9600 KB
01-19.txt
AC
33 ms
9728 KB
01-20.txt
AC
24 ms
10368 KB
01-21.txt
AC
21 ms
5120 KB
01-22.txt
AC
21 ms
5120 KB
01-23.txt
AC
19 ms
5120 KB
01-24.txt
AC
16 ms
5120 KB
01-25.txt
AC
15 ms
5376 KB
01-26.txt
AC
15 ms
5888 KB
01-27.txt
AC
13 ms
8064 KB
01-28.txt
AC
5 ms
5888 KB
01-29.txt
AC
4 ms
5248 KB
01-30.txt
AC
4 ms
5376 KB
sample-01.txt
AC
3 ms
4992 KB
sample-02.txt
AC
3 ms
4992 KB