# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
153850 | 2019-09-17T04:59:12 Z | Ruxandra985 | Baloni (COCI15_baloni) | C++14 | 103 ms | 1400 KB |
#include <cstdio> #include <algorithm> #include <set> using namespace std; int f[1000010]; int main() { FILE *fin = stdin; FILE *fout = stdout; int n,i,x; int sol = 0; fscanf (fin,"%d",&n); for (i=1;i<=n;i++){ fscanf(fin,"%d",&x); if (f[x+1]==0) sol++; f[x] = i; } fprintf (fout,"%d",sol); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Incorrect | 3 ms | 376 KB | Output isn't correct |
3 | Incorrect | 2 ms | 376 KB | Output isn't correct |
4 | Incorrect | 3 ms | 256 KB | Output isn't correct |
5 | Incorrect | 103 ms | 1380 KB | Output isn't correct |
6 | Incorrect | 101 ms | 1380 KB | Output isn't correct |
7 | Incorrect | 82 ms | 1400 KB | Output isn't correct |
8 | Incorrect | 81 ms | 1400 KB | Output isn't correct |
9 | Incorrect | 90 ms | 1400 KB | Output isn't correct |
10 | Incorrect | 90 ms | 760 KB | Output isn't correct |