Codeforces Round #563 (Div. 2) B. Ehab Is an Odd Person
2024-08-21 06:06:50
链接:https://codeforces.com/contest/1174/problem/B
题意:
You're given an array aa of length nn. You can perform the following operation on it as many times as you want:
- Pick two integers ii and jj (1≤i,j≤n)(1≤i,j≤n) such that ai+ajai+aj is odd, then swap aiai and ajaj.
What is lexicographically the smallest array you can obtain?
An array xx is lexicographically smaller than an array yy if there exists an index ii such that xi<yixi<yi, and xj=yjxj=yj for all 1≤j<i1≤j<i. Less formally, at the first index ii in which they differ, xi<yi
思路:
记录偶数和奇数的个数,只要数组内同时有偶数和奇数,无论几个都可以使数组完全排序。
代码:
#include <bits/stdc++.h> using namespace std; typedef long long LL;
const int MAXN = 3e5 + 10;
const int MOD = 1e9 + 7;
int n, m, k, t; int a[MAXN]; int main()
{
cin >> n;
bool flag1 = false, flag2 = false;
for (int i = 1;i <= n;i++)
{
cin >> a[i];
if (a[i] % 2 == 0)
flag1 = true;
if (a[i] % 2 == 1)
flag2 = true;
}
if (flag1 && flag2)
sort(a+1, a+1+n);
for (int i = 1;i <= n;i++)
cout << a[i] << ' ';
cout << endl; return 0;
}
最新文章
- 关于RSA加密算法的长度限制问题
- PHP防SQL注入不要再用addslashes和mysql_real_escape_string
- SVN简介
- udp通信的原理---makefile文件
- UIWebView获得内容的高-作出自适应高的UIWebView
- mysql给日期增减
- 有一种风格,叫做 Low Poly 3D
- Collections.synchronizedMap 详解
- Heritrix个性化设置抓取目标
- hdu_2110_Crisis of HDU(母函数)
- Android关于AutoService、Javapoet讲解
- [UVa-437] Color Length
- [Swift]LeetCode629. K个逆序对数组 | K Inverse Pairs Array
- 分类器、logistic回归
- Redis Cluster [WARNING] Node 127.0.0.1:7003 has slots in migrating state (15495).
- 微信小程序开发--路由切换,页面重定向
- HDU 4725 The Shortest Path in Nya Graph(构图)
- 学习笔记37—WIN7系统本地连接没有有效的IP地址 电脑本地连接无有效ip配置怎么办
- Http Header Content-Typ
- Java语法基础学习DaySix