Submission #57286199


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 987654321234567
int N, A[101];
char S[101];
signed main() {
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> A[i] >> S[i];
}
int ans = 0;
int Lcur = INF, Rcur = INF;
for (int i = 1; i <= N; i++) {
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#include <bits/stdc++.h>

using namespace std;
#define int long long
#define INF 987654321234567

int N, A[101];
char S[101];

signed main() {

    cin >> N;
    
    for (int i = 1; i <= N; i++) {
        cin >> A[i] >> S[i];
    }

    int ans = 0;
    int Lcur = INF, Rcur = INF;

    for (int i = 1; i <= N; i++) {
        if (S[i] == 'L') {
            if (Lcur == INF) {
                Lcur = A[i];
            } else {
                ans += abs(Lcur - A[i]);
                Lcur = A[i];
            }
        } else {
            if (Rcur == INF) {
                Rcur = A[i];
            } else {
                ans += abs(Rcur - A[i]);
                Rcur = A[i];
            }
        }
    }

    cout << ans << '\n';
}

Submission Info

Submission Time
Task B - Piano 3
User YunjunDique3cm
Language C++ 20 (gcc 12.2)
Score 200
Code Size 775 Byte
Status AC
Exec Time 1 ms
Memory 3652 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 20
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_random_00.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 01_random_10.txt, 01_random_11.txt, 01_random_12.txt, 01_random_13.txt, 01_random_14.txt, 02_handmade_00.txt, 02_handmade_01.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 1 ms 3652 KB
00_sample_01.txt AC 1 ms 3344 KB
00_sample_02.txt AC 1 ms 3496 KB
01_random_00.txt AC 1 ms 3452 KB
01_random_01.txt AC 1 ms 3364 KB
01_random_02.txt AC 1 ms 3456 KB
01_random_03.txt AC 1 ms 3452 KB
01_random_04.txt AC 1 ms 3460 KB
01_random_05.txt AC 1 ms 3492 KB
01_random_06.txt AC 1 ms 3456 KB
01_random_07.txt AC 1 ms 3460 KB
01_random_08.txt AC 1 ms 3436 KB
01_random_09.txt AC 1 ms 3432 KB
01_random_10.txt AC 1 ms 3452 KB
01_random_11.txt AC 1 ms 3496 KB
01_random_12.txt AC 1 ms 3452 KB
01_random_13.txt AC 1 ms 3456 KB
01_random_14.txt AC 1 ms 3488 KB
02_handmade_00.txt AC 1 ms 3464 KB
02_handmade_01.txt AC 1 ms 3440 KB


2025-03-05 (Wed)
18:09:58 +00:00