# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
18413 | suhgyuho_william | 구간 성분 (KOI15_interval) | C++98 | 475 ms | 1980 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 <stdio.h>
#include <string.h>
#include <algorithm>
#include <map>
using namespace std;
#define Asize 7
#define MOD 4
int N,M;
int a[1510],b[1510],tmp[1510];
char s[1510];
struct data{
long long a[Asize];
bool operator<(const data x)const{
int i;
for(i=0; i<Asize; i++){
if(x.a[i] != a[i]) return a[i] < x.a[i];
}
return false;
}
};
struct data2{
long long a[26];
}cnt1[1510],cnt2[1510];
data t;
map<data,bool> Map;
# | 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... |