# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
909988 | AlphaMale06 | 스탬프 수집 (JOI16_ho_t2) | C++14 | 5 ms | 3932 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define int long long
const int N = 100002;
int pref[N][3];
void solve(){
int n;
cin >> n;
string s;
cin >> s;
int a[n];
for(int i=0; i< n; i++){
if(s[i]=='J')a[i]=0;
else if(s[i]=='O')a[i]=1;
else a[i]=2;
}
for(int i=1; i<=n; i++){
for(int j=0; j< 3; j++){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |