結果
問題 | No.766 金魚すくい |
ユーザー |
![]() |
提出日時 | 2019-04-26 14:20:52 |
言語 | C (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 131 ms / 1,500 ms |
コード長 | 6,065 bytes |
コンパイル時間 | 1,019 ms |
コンパイル使用メモリ | 34,176 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-24 08:58:00 |
合計ジャッジ時間 | 4,269 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 42 |
ソースコード
#include <float.h>#include <limits.h>#include <math.h>#include <stdio.h>#include <stdlib.h>#include <string.h>#include <time.h>// 内部定数#define D_MOD 1000000007 // 除数(10の9乗+7)#define D_FISH_MAX 100005 // 最大魚数#define D_FACT_MAX D_FISH_MAX // 最大階乗数// 内部変数static FILE *szpFpI; // 入力static int siFCnt; // 魚数static int siPCnt; // ポイ数static int siFRate; // 破損率static int si1Val[D_FISH_MAX]; // 価値[魚]static int si1SRate[D_FISH_MAX]; // 連続成功率static int si1FRate[D_FISH_MAX]; // 連続失敗率static int si1HRate[D_FISH_MAX * 2]; // 百分率(逆元)static int si1ModFact[D_FACT_MAX]; // 階乗リストstatic int si1ModFactR[D_FACT_MAX]; // 階乗リスト(逆元)// 内部変数 - テスト用#ifdef D_TESTstatic int siRes;static FILE *szpFpA;static int siTNo;#endif// 出力intfOut(char *pcpLine // <I> 1行){char lc1Buf[1024];#ifdef D_TESTfgets(lc1Buf, sizeof(lc1Buf), szpFpA);if (strcmp(lc1Buf, pcpLine)) {siRes = -1;}#elseprintf("%s", pcpLine);#endifreturn 0;}// ソート関数 - int降順intfSortFnc(const void *pzpVal1 // <I> 値1, const void *pzpVal2 // <I> 値2){int *lipVal1 = (int *)pzpVal1;int *lipVal2 = (int *)pzpVal2;// int降順if (*lipVal1 > *lipVal2) {return -1;}else if (*lipVal1 < *lipVal2) {return 1;}return 0;}// べき乗 - 取得intfGetModPower(int piBase // <I> 基数, int piIdx // <I> 指数){// 平方リスト - 作成int li1Val[100];li1Val[0] = piBase;int liCnt = 1;int liIdx = 1;while (piIdx > liIdx) {li1Val[liCnt] = (int)((long long)li1Val[liCnt - 1] * (long long)li1Val[liCnt - 1] % (long long)D_MOD);liCnt++;liIdx += liIdx;}// べき乗 - 取得int liVal = 1;while (piIdx > 0) {if (piIdx >= liIdx) {piIdx -= liIdx;liVal = (int)((long long)liVal * (long long)li1Val[liCnt - 1] % (long long)D_MOD);}liCnt--;liIdx /= 2;}return liVal;}// 階乗リスト - 作成intfMakeModFact(int piMax // <I> 最大値){int i;si1ModFact[0] = 1;si1ModFact[1] = 1;for (i = 2; i <= piMax; i++) {si1ModFact[i] = (int)((long long)si1ModFact[i - 1] * (long long)i % (long long)D_MOD);}return 0;}// 階乗リスト(逆元) - 作成intfMakeModFactR(int piMax // <I> 最大値){int i;for (i = 0; i <= piMax; i++) {si1ModFactR[i] = fGetModPower(si1ModFact[i], D_MOD - 2);}return 0;}// 実行メインintfMain(){int i;char lc1Buf[1024];// 魚数・ポイ数・破損率 - 取得fgets(lc1Buf, sizeof(lc1Buf), szpFpI);sscanf(lc1Buf, "%d%d%d", &siFCnt, &siPCnt, &siFRate);// 価値 - 取得for (i = 1; i <= siFCnt; i++) {fscanf(szpFpI, "%d", &si1Val[i]);}fgets(lc1Buf, sizeof(lc1Buf), szpFpI);// 価値 - ソートqsort(&si1Val[1], siFCnt, sizeof(int), fSortFnc);// 確率 - セットsi1SRate[0] = 1;for (i = 1; i <= siFCnt; i++) {si1SRate[i] = (int)((long long)si1SRate[i - 1] * (long long)(100 - siFRate) % (long long)D_MOD);}si1FRate[0] = 1;for (i = 1; i <= siPCnt; i++) {si1FRate[i] = (int)((long long)si1FRate[i - 1] * (long long)siFRate % (long long)D_MOD);}si1HRate[0] = 1;for (i = 1; i <= siFCnt + siPCnt; i++) {si1HRate[i] = (int)((long long)si1HRate[i - 1] * (long long)100 % (long long)D_MOD);}for (i = 1; i <= siFCnt + siPCnt; i++) {si1HRate[i] = fGetModPower(si1HRate[i], D_MOD - 2);}// 階乗リスト - 作成fMakeModFact(siFCnt + siPCnt);fMakeModFactR(siFCnt + siPCnt);// 期待値 - 取得 - 1~siFCnt-1int liExp = 0;int liSum = 0;for (i = 1; i < siFCnt; i++) {liSum += si1Val[i];liSum %= D_MOD;int liVal = liSum;liVal = (int)((long long)liVal * (long long)si1SRate[i] % (long long)D_MOD);liVal = (int)((long long)liVal * (long long)si1FRate[siPCnt] % (long long)D_MOD);liVal = (int)((long long)liVal * (long long)si1HRate[i + siPCnt] % (long long)D_MOD);liVal = (int)((long long)liVal * (long long)si1ModFact[i + siPCnt - 1] % (long long)D_MOD);liVal = (int)((long long)liVal * (long long)si1ModFactR[i] % (long long)D_MOD);liVal = (int)((long long)liVal * (long long)si1ModFactR[siPCnt - 1] % (long long)D_MOD);liExp += liVal;liExp %= D_MOD;}// 期待値 - 取得 - siFCntliSum += si1Val[siFCnt];liSum %= D_MOD;for (i = 0; i < siPCnt; i++) {int liVal = liSum;liVal = (int)((long long)liVal * (long long)si1SRate[siFCnt] % (long long)D_MOD);liVal = (int)((long long)liVal * (long long)si1FRate[i] % (long long)D_MOD);liVal = (int)((long long)liVal * (long long)si1HRate[siFCnt + i] % (long long)D_MOD);liVal = (int)((long long)liVal * (long long)si1ModFact[siFCnt - 1 + i] % (long long)D_MOD);liVal = (int)((long long)liVal * (long long)si1ModFactR[siFCnt - 1] % (long long)D_MOD);liVal = (int)((long long)liVal * (long long)si1ModFactR[i] % (long long)D_MOD);liExp += liVal;liExp %= D_MOD;}return liExp;}// 1回実行intfOne(){int liRet;char lc1Buf[1024];// 入力 - セット#ifdef D_TESTsprintf(lc1Buf, ".\\Test\\T%d.txt", siTNo);szpFpI = fopen(lc1Buf, "r");sprintf(lc1Buf, ".\\Test\\A%d.txt", siTNo);szpFpA = fopen(lc1Buf, "r");siRes = 0;#elseszpFpI = stdin;#endif// 実行メインliRet = fMain();// 出力sprintf(lc1Buf, "%d\n", liRet);fOut(lc1Buf);// 残データ有無#ifdef D_TESTlc1Buf[0] = '\0';fgets(lc1Buf, sizeof(lc1Buf), szpFpA);if (strcmp(lc1Buf, "")) {siRes = -1;}#endif// テストファイルクローズ#ifdef D_TESTfclose(szpFpI);fclose(szpFpA);#endif// テスト結果#ifdef D_TESTif (siRes == 0) {printf("OK %d\n", siTNo);}else {printf("NG %d\n", siTNo);}#endifreturn 0;}// プログラム開始intmain(){#ifdef D_TESTint i;for (i = D_TEST_SNO; i <= D_TEST_ENO; i++) {siTNo = i;fOne();}#elsefOne();#endifreturn 0;}