Submission #3819671
Source Code Expand
/// author:Kissheart ///
#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
#include<vector>
#include<stdlib.h>
#include<math.h>
#include<queue>
#include<deque>
#include<ctype.h>
#include<map>
#include<set>
#include<stack>
#include<string>
#define INF 0x3f3f3f3f
#define FAST_IO ios::sync_with_stdio(false)
const double PI = acos(-1.0);
const double eps = 1e-6;
const int MAX=2e5+10;
const int mod=1e9+7;
typedef long long ll;
using namespace std;
#define gcd(a,b) __gcd(a,b)
inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
inline ll qpow(ll a,ll b){ll r=1,t=a; while(b){if(b&1)r=(r*t)%mod;b>>=1;t=(t*t)%mod;}return r;}
inline ll inv1(ll b){return qpow(b,mod-2);}
inline ll exgcd(ll a,ll b,ll &x,ll &y){if(!b){x=1;y=0;return a;}ll r=exgcd(b,a%b,y,x);y-=(a/b)*x;return r;}
inline ll read(){ll x=0,f=1;char c=getchar();for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;for(;isdigit(c);c=getchar()) x=x*10+c-'0';return x*f;}
//freopen( "in.txt" , "r" , stdin );
//freopen( "data.txt" , "w" , stdout );
int n,t,ans;
int p,q,sum;
int a[MAX],vis[MAX];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
t=n/2;
for(int i=2;i<=n;i+=2)
{
vis[a[i]]++;
if(vis[a[i]]>sum)
{
sum=vis[a[i]];
p=a[i];
}
}
ans=(t-sum);
sum=0;
memset(vis,0,sizeof(vis));
for(int i=1;i<=n;i+=2)
{
vis[a[i]]++;
if(vis[a[i]]>sum && a[i]!=p)
sum=vis[a[i]];
}
ans+=(t-sum);
printf("%d\n",ans);
return 0;
}
Submission Info
Submission Time |
|
Task |
C - /\/\/\/ |
User |
l851172608 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1612 Byte |
Status |
WA |
Exec Time |
11 ms |
Memory |
1408 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:37:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:38:44: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
^
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 300 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample1_3132.txt, sample2_iw.txt, sample3_1111.txt |
All |
ababa_0.txt, ababa_1.txt, eq_0.txt, eq_1.txt, rnd_17.txt, sample1_3132.txt, sample2_iw.txt, sample3_1111.txt, top2_0.txt, top2_1.txt, top2_2.txt, top2_3.txt, top2modoki_0.txt, top2modoki_1.txt, top2modoki_2.txt, top2modoki_3.txt, vary_1.txt, vary_2.txt, vary_3.txt, zoro_0.txt |
Case Name |
Status |
Exec Time |
Memory |
ababa_0.txt |
AC |
11 ms |
1408 KB |
ababa_1.txt |
AC |
11 ms |
1408 KB |
eq_0.txt |
AC |
11 ms |
1408 KB |
eq_1.txt |
AC |
11 ms |
1408 KB |
rnd_17.txt |
AC |
11 ms |
1408 KB |
sample1_3132.txt |
AC |
2 ms |
1024 KB |
sample2_iw.txt |
AC |
2 ms |
1024 KB |
sample3_1111.txt |
AC |
2 ms |
1024 KB |
top2_0.txt |
AC |
11 ms |
1408 KB |
top2_1.txt |
WA |
11 ms |
1408 KB |
top2_2.txt |
AC |
11 ms |
1408 KB |
top2_3.txt |
WA |
11 ms |
1408 KB |
top2modoki_0.txt |
AC |
11 ms |
1408 KB |
top2modoki_1.txt |
WA |
11 ms |
1408 KB |
top2modoki_2.txt |
AC |
11 ms |
1408 KB |
top2modoki_3.txt |
AC |
11 ms |
1408 KB |
vary_1.txt |
AC |
11 ms |
1408 KB |
vary_2.txt |
AC |
11 ms |
1408 KB |
vary_3.txt |
AC |
11 ms |
1408 KB |
zoro_0.txt |
AC |
2 ms |
1024 KB |