(cache)Submission #60080888 - AtCoder Beginner Contest 381

Contest Duration: 2024-11-22(Fri) 21:00 - 2024-11-22(Fri) 22:40 (local time) (100 minutes) Back to Home

Submission #60080888

Source Code Expand

Copy

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main() {
    ll n;
    cin >> n;
    vector<ll> a(n);
    rep(i, n) cin >> a[i];
  
    vector<pll> b;
    ll count = 0;
    rep(i, n) {
        if (i == 0 || a[i] != a[i - 1]) {
            if (i != 0) b.push_back({count, a[i - 1]});
            count = 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;

#define rep(i, n) for (ll i = 0; i < (n); i++)

int main() {
    ll n;
    cin >> n;
    vector<ll> a(n);
    rep(i, n) cin >> a[i];
  
    vector<pll> b;
    ll count = 0;
    rep(i, n) {
        if (i == 0 || a[i] != a[i - 1]) {
            if (i != 0) b.push_back({count, a[i - 1]});
            count = 1;
        } else {
            count++;
        }
    }
    b.push_back({count, a[n - 1]});
    ll res = 0; 
    ll cur = 0;
    ll vis = 0; 

    rep(i, b.size()) {
        ll c = b[i].first;
        ll v = b[i].second;
        if (c != 2 || (vis & (1LL << v))) {
            res = max(res, cur * 2);
            cur = (c == 2) ? 1 : 0; 
            vis = 0; 
        }
        if (c == 2) {
            cur++;
            vis |= (1LL << v); 
        }
    }
    res = max(res, cur * 2);
    cout << res << endl;
    return 0;
}

Submission Info

Submission Time	2024-11-22 22:25:49
Task	D - 1122 Substring
User	po1
Language	C++ 20 (gcc 12.2)
Score	0
Code Size	1014 Byte
Status	WA
Exec Time	37 ms
Memory	8892 KiB

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:8:36: warning: comparison of integer expressions of different signedness: ‘ll’ {aka ‘long long int’} and ‘std::vector<std::pair<long long int, long long int> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
    8 | #define rep(i, n) for (ll i = 0; i < (n); i++)
      |                                    ^
Main.cpp:31:5: note: in expansion of macro ‘rep’
   31 |     rep(i, b.size()) {
      |     ^~~

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

0 / 425

Status

× 3

AC	× 7
WA	× 32

Set Name	Test Cases
Sample	example_00.txt, example_01.txt, example_02.txt
All	example_00.txt, example_01.txt, example_02.txt, hand_00.txt, hand_01.txt, hand_02.txt, hand_03.txt, hand_04.txt, hand_05.txt, random_00.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_16.txt, random_17.txt, random_18.txt, random_19.txt, random_20.txt, random_21.txt, random_22.txt, random_23.txt, random_24.txt, random_25.txt, random_26.txt, random_27.txt, random_28.txt, random_29.txt

Case Name	Status	Exec Time	Memory
example_00.txt	AC	1 ms	3464 KiB
example_01.txt	AC	1 ms	3516 KiB
example_02.txt	AC	1 ms	3460 KiB
hand_00.txt	WA	37 ms	6740 KiB
hand_01.txt	AC	37 ms	8892 KiB
hand_02.txt	WA	36 ms	6936 KiB
hand_03.txt	WA	36 ms	6732 KiB
hand_04.txt	WA	32 ms	4720 KiB
hand_05.txt	AC	1 ms	3488 KiB
random_00.txt	WA	35 ms	6744 KiB
random_01.txt	WA	36 ms	6800 KiB
random_02.txt	WA	36 ms	6792 KiB
random_03.txt	WA	36 ms	6836 KiB
random_04.txt	WA	35 ms	6760 KiB
random_05.txt	WA	36 ms	6744 KiB
random_06.txt	WA	35 ms	6732 KiB
random_07.txt	WA	36 ms	6796 KiB
random_08.txt	WA	35 ms	6744 KiB
random_09.txt	WA	37 ms	6772 KiB
random_10.txt	WA	35 ms	6900 KiB
random_11.txt	WA	37 ms	6788 KiB
random_12.txt	WA	36 ms	6732 KiB
random_13.txt	WA	37 ms	6800 KiB
random_14.txt	WA	36 ms	6732 KiB
random_15.txt	WA	36 ms	6792 KiB
random_16.txt	WA	36 ms	6780 KiB
random_17.txt	WA	36 ms	6780 KiB
random_18.txt	WA	36 ms	6800 KiB
random_19.txt	WA	37 ms	6940 KiB
random_20.txt	WA	37 ms	8788 KiB
random_21.txt	WA	36 ms	6704 KiB
random_22.txt	WA	36 ms	6800 KiB
random_23.txt	WA	36 ms	6800 KiB
random_24.txt	WA	36 ms	6744 KiB
random_25.txt	WA	36 ms	6696 KiB
random_26.txt	WA	37 ms	8880 KiB
random_27.txt	WA	36 ms	6780 KiB
random_28.txt	AC	37 ms	8840 KiB
random_29.txt	AC	37 ms	8804 KiB