QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#518201 | #8644. Tricolor Lights | green_gold_dog# | 0 | 1ms | 4516kb | C++20 | 1.1kb | 2024-08-13 18:01:36 | 2024-08-13 18:01:37 |
Anna
#include "Anna.h"
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
mt19937 rnd(228);
const ll len = 130;
char to(ll x) {
if (x == 0) {
return 'R';
}
if (x == 1) {
return 'G';
}
if (x == 2) {
return 'B';
}
}
pair<string, ll> anna(ll n, string s) {
string ans(n, 'A');
vector<ll> nums(n);
for (ll i = 0; i < n; i++) {
nums[i] = rnd() % 3;
}
for (ll i = 0; i < n; i++) {
set<char> all;
all.insert('R');
all.insert('G');
all.insert('B');
all.erase(s[i]);
all.erase(to(nums[i]));
vector<char> a;
for (auto i : all) {
a.push_back(i);
}
ans[i] = a[rnd() % a.size()];
}
return make_pair(ans, len);
}
Bruno
#include "Bruno.h"
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
mt19937 rnd(228);
const ll len = 130;
char to(ll x) {
if (x == 0) {
return 'R';
}
if (x == 1) {
return 'G';
}
if (x == 2) {
return 'B';
}
}
vector<ll> arr;
void init(ll n, ll l) {
arr.resize(n);
while (true) {
arr[0] = rnd() % 3;
}
}
ll bruno(string u) {
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 4516kb
Manager to Aoi
Start Success 8 RGGBRBBG WA
Aoi to Manager
Start 0 4
Manager to Bitaro
Start WA
Bitaro to Manager
Start
Manager to Checker
0.00
result:
points 0.0
Subtask #2:
score: 0
Skipped
Subtask #3:
score: 0
Skipped
Subtask #4:
score: 0
Skipped
Subtask #5:
score: 0
Wrong Answer
Test #80:
score: 0
Wrong Answer
time: 0ms
memory: 4328kb
Manager to Aoi
Start Success 8 RGGBRBBG WA
Aoi to Manager
Start 0 4
Manager to Bitaro
Start WA
Bitaro to Manager
Start
Manager to Checker
0.00
result:
points 0.0