#pragma GCC optimize("Ofast")
#include "memory.h"
#include "grader.h"
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
int num[55]={0};
vector<int> g[55];
void play(){
int i;
for(i=1;i<=50;i++){
num[i]=faceup(i)-'A';
g[num[i]].emplace_back(i);
}
for(i=1;i<=25;i++){
faceup(g[i][0]);
faceup(g[i][1]);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
6 ms |
384 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
6 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |