| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1164190 | KhoaDuy | Tricolor Lights (JOI24_tricolor) | C++20 | 20 ms | 1836 KiB |
#include "Anna.h"
#include<bits/stdc++.h>
using namespace std;
pair<string,int> anna(int n,string s){
string t="";
char choice[3]={'R','G','B'};
for(int i=0;i<n;i++){
for(int j=0;j<3;j++){
if(choice[j]!=s[i]){
t+=choice[j];
break;
}
}
}
if(n<=130){
return {t,n};
}
for(int j=0;j<3;j++){
if(choice[j]!=s[0]&&choice[j]!=s[1]){
t[0]=choice[j],t[1]=choice[j];
break;
}
}
for(int j=0;j<3;j++){
if(choice[j]!=s[2]&&choice[j]!=t[1]){
t[2]=choice[j];
break;
}
}
return {t,130};
}
#include "Bruno.h"
#include<bits/stdc++.h>
using namespace std;
int n,l;
void init(int N,int L){
n=N,l=L;
}
int bruno(string u){
if(n<=130){
return 1;
}
if(u[0]==u[1]){
return 1;
}
return 2;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
