Submission #2240905
Source Code Expand
#include <iostream>
#include <array>
#include <map>
#include <algorithm>
#include <cmath>
#include <vector>
#include <fstream>
#include <string>
#include <random>
#include <queue>
#include <iomanip>
#include <functional>
#include <climits>
#include <tuple>
#include <unordered_map>
#include <limits>
#include <functional>
#include <cassert>
#include <numeric>
#include <bitset>
#include <set>
#define FOR(x,n) for(int x = 0; x < n; x++)
#define INPUT(x) scanf("%d",&x)
#define PUT(x) printf("%d",x)
#define DPUT(x) printf("%.15lf\n",x)
#define GET(x,y) std::get<x>(y)
#define CHMAX(x,y) x = std::max(x,y)
#define CHMIN(x,y) x = std::min(x,y)
#define SP_END (i != n - 1 ? ' ' : '\n') ;
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vll = std::vector<ll>;
using vpll = std::vector<pll>;
using vpii = std::vector<pii>;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vvpii = std::vector<vpii>;
using vch = std::vector<char>;
using vvch = std::vector<vch>;
using tiii = std::tuple<int, int, int>;
const ll mod197 = 1000000007LL;
const ll INF = 10000000000LL;
const double PI11 = 3.14159265359;
const int dis[5] = { 0,1,0,-1,0 };
const int disD[4] = { 0,1,1,0 };
const int disLD[3] = { 0,1,0 };
const char disC[4] = { 'U','D','R','L' };
const char disY[4] = { -1,1,0,0 };
const char disX[4] = { 0,0,1,-1 };
ll arr[5] = {};
ll A[5] = {};
//最大公約数
ll gcd(ll a, ll b) {
if (a%b == 0)
return b;
return gcd(b, a%b);
}
int main(void)
{
ll N, answer = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
arr[A[i]]++;
}
for (int i = 0; i < N; i++) {
if (A[i] == 3 && arr[3] > 0 ) {
if (arr[1] > 0) {
arr[1]--;
}
arr[3]--;
}
else if (A[i] == 4 && arr[4] > 0) {
arr[4]--;
}
else if (A[i] == 2 && arr[2] > 0) {
if (arr[2] >= 2) {
arr[2]-=2;
}
else if (arr[1] > 0) {
arr[2]--;
arr[1]--;
if (arr[1] > 0) {
arr[1]--;
}
}
else {
arr[2]--;
}
}
else if(A[i] == 1 && arr[1] > 0){
if (arr[3] > 0) {
arr[1]--;
arr[3]--;
}
else if (arr[2] > 0) {
arr[1]--;
arr[2]--;
if (arr[1] > 0) {
arr[1]--;
}
}
else {
arr[1] -= min(4LL,arr[1]);
}
}
answer++;
}
cout << answer << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - 動画検索 |
User |
nasatame |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
2441 Byte |
Status |
RE |
Exec Time |
100 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
All |
sample_01.txt, sample_02.txt, sample_03.txt, hand_01.txt, hand_02.txt, hand_03.txt, random_01.txt, random_02.txt, random_03.txt, sample_01.txt, sample_02.txt, sample_03.txt |
Case Name |
Status |
Exec Time |
Memory |
hand_01.txt |
RE |
99 ms |
256 KB |
hand_02.txt |
AC |
1 ms |
256 KB |
hand_03.txt |
WA |
1 ms |
256 KB |
random_01.txt |
RE |
99 ms |
256 KB |
random_02.txt |
RE |
100 ms |
256 KB |
random_03.txt |
RE |
99 ms |
256 KB |
sample_01.txt |
WA |
1 ms |
256 KB |
sample_02.txt |
WA |
1 ms |
256 KB |
sample_03.txt |
RE |
99 ms |
256 KB |