#include "gondola.h"
#include <vector>
#include <algorithm>
#define MOD 1000000009
using namespace std;
int valid(int n, int inputSeq[])
{
int bas = -1;
for (int i = 0; i < n; i++)
if(inputSeq[i] < n) {
bas = i;
break;
}
int s = bas == -1 ? 1 : inputSeq[bas];
bas = bas == -1 ? 0 : bas;
int bayrak = 1;
for (int i = bas; i < n; i++, s++)
if(inputSeq[i] != s && inputSeq[i] < n) {
bayrak = 0;
break;
}
for (int i = 0; i < bas; i++, s++)
if(inputSeq[i] != s && inputSeq[i] < n) {
bayrak = 0;
break;
}
if(!bayrak) return 0;
vector<int> v (inputSeq, inputSeq+n);
sort(v.begin(), v.end());
for(int i = 1; i < n; i++)
if(v[i] == v[i-1]) {
bayrak = 0;
break;
}
return bayrak;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
long long us(long long a, long long b) {
if(b == 1) return a;
if(b & 1) return (us(a, b>>1) * us(a, b>>1) * a) % MOD;
return (us(a, b>>1) * us(a, b>>1)) % MOD;
}
int countReplacement(int n, int inputSeq[])
{
vector<int> v;
for (int i = 0; i < n; i++)
if (inputSeq[i] > n) v.push_back(inputSeq[i]);
sort(v.begin(), v.end());
long long sonuc = 1;
if (v.size() == n) sonuc = n;
int onceki = n;
for(int i = 0; i < v.size(); i++) {
sonuc *= us(v.size()-i, v[i]-onceki);
sonuc %= MOD;
onceki = v[i];
}
return sonuc % MOD;
}
Compilation message
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:73:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (v.size() == n) sonuc = n;
^
gondola.cpp:76:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < v.size(); i++) {
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
3300 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
3300 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
3300 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
3300 KB |
Integer -2 violates the range [0, 350000] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
3300 KB |
Integer -2 violates the range [0, 350000] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
3300 KB |
Integer -2 violates the range [0, 350000] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
3300 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
3300 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
3300 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
3300 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |