Submission #2699742
Source Code Expand
int replace(int N, char S[]) { int ans = 4; int flag[16] = {0}; for (int i = 0; i < N; i++) { int ic = S[i] == 'I' ? 0 : 1; if (flag[ic+1]) continue; flag[ic+1] = 1; for (int j = i+1; j < N; j++) { int jc = S[j] == 'J' ? 0 : 1; if (flag[((jc+1)<<2)|(ic+1)]) continue; flag[((jc+1)<<2)|(ic+1)] = 1; for (int p = j+1; p < N; p++) { int pc = S[p] == 'P' ? 0 : 1; if (flag[((pc+1)<<4)|((jc+1)<<2)|(ic+1)]) continue; flag[((pc+1)<<4)|((jc+1)<<2)|(ic+1)] = 1; for (int c = p+1; c < N;c ++) { int cc = S[c] == 'C' ? 0 : 1; if (flag[((cc+1)<<6)|((pc+1)<<4)|((jc+1)<<2)|(ic+1)]) continue; flag[((cc+1)<<6)|((pc+1)<<4)|((jc+1)<<2)|(ic+1)] = 1; int tmp = ic + jc + pc + cc; if (tmp < ans) { ans = tmp; } } } } } return ans; }
Submission Info
Submission Time | |
---|---|
Task | A - 国際情報オリンピック日本代表プログラミングコンテスト (Welcome to IJPC) |
User | neetsdkasu |
Language | IOI-Style C++ (GCC 5.4.1) |
Score | 0 |
Code Size | 1086 Byte |
Status | WA |
Exec Time | 2 ms |
Memory | 256 KB |
Compile Error
./grader.cpp: In function ‘int main()’: ./grader.cpp:10:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%s", &N, S); ^
Judge Result
Set Name | Subtask1 | Subtask2 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 50 | 0 / 50 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Subtask1 | subtask1/1, subtask1/10, subtask1/11, subtask1/12, subtask1/13, subtask1/14, subtask1/2, subtask1/3, subtask1/4, subtask1/5, subtask1/6, subtask1/7, subtask1/8, subtask1/9 |
Subtask2 | subtask2/1, subtask2/10, subtask2/11, subtask2/12, subtask2/13, subtask2/2, subtask2/3, subtask2/4, subtask2/5, subtask2/6, subtask2/7, subtask2/8, subtask2/9 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask1/1 | WA | 1 ms | 128 KB |
subtask1/10 | WA | 1 ms | 128 KB |
subtask1/11 | WA | 1 ms | 128 KB |
subtask1/12 | WA | 1 ms | 128 KB |
subtask1/13 | WA | 1 ms | 128 KB |
subtask1/14 | WA | 1 ms | 128 KB |
subtask1/2 | AC | 1 ms | 128 KB |
subtask1/3 | AC | 1 ms | 128 KB |
subtask1/4 | WA | 0 ms | 128 KB |
subtask1/5 | WA | 1 ms | 128 KB |
subtask1/6 | AC | 1 ms | 128 KB |
subtask1/7 | AC | 1 ms | 128 KB |
subtask1/8 | WA | 1 ms | 128 KB |
subtask1/9 | WA | 1 ms | 128 KB |
subtask2/1 | WA | 1 ms | 128 KB |
subtask2/10 | AC | 2 ms | 256 KB |
subtask2/11 | WA | 1 ms | 256 KB |
subtask2/12 | WA | 2 ms | 256 KB |
subtask2/13 | WA | 2 ms | 256 KB |
subtask2/2 | WA | 1 ms | 128 KB |
subtask2/3 | WA | 1 ms | 128 KB |
subtask2/4 | WA | 1 ms | 128 KB |
subtask2/5 | WA | 1 ms | 128 KB |
subtask2/6 | WA | 2 ms | 256 KB |
subtask2/7 | AC | 1 ms | 256 KB |
subtask2/8 | WA | 2 ms | 256 KB |
subtask2/9 | WA | 2 ms | 256 KB |