Submission #682153
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll mod = 1000000007; ll modpow(ll x, ll y, ll mod){ if(y == 0) return 1; ll t = modpow(x, y/2, mod); return y%2 == 0 ? t*t%mod : t*t%mod*x%mod; } ll modinv(ll x, ll mod){ return modpow(x, mod-2, mod); } ll lagrangeInterpolation(const vector<ll> &x, const vector<ll> &fx, ll t){ auto it = find(x.begin(), x.end(), t); if(it != x.end()) return fx[it - x.begin()]; int n = x.size() - 1; ll nume = 1; for(int m = 0; m <= n; ++m){ nume *= (t-x[m]+mod) % mod; nume %= mod; } ll res = 0; for(int k = 0; k <= n; k++){ ll e = 1; for(int m = 0; m <= n; m++){ if(m != k){ e *= (x[k]-x[m]+mod) % mod; e %= mod; } } ll r = nume; r *= modinv((t-x[k]+mod) % mod, mod); r %= mod; r *= modinv(e, mod); r %= mod; res += fx[k] * r % mod; } return res % mod; } int main(){ int n; while(cin >> n){ vector<ll> t(n+1), ft(n+1); for(int i = 0; i <= n; ++i){ t[i] = i; cin >> ft[i]; } ll x; cin >> x; cout << lagrangeInterpolation(t,ft,x) << endl; } }
Submission Info
Submission Time | |
---|---|
Task | D - 見たことのない多項式 |
User | tubo28 |
Language | C++11 (GCC 4.8.1) |
Score | 80 |
Code Size | 1359 Byte |
Status | TLE |
Exec Time | 2037 ms |
Memory | 2544 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | Subtask3 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 40 / 40 | 40 / 40 | 0 / 20 | ||||||||||
Status |
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
Subtask1 | sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt |
Subtask2 | sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt |
Subtask3 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask3_01.txt, subtask3_02.txt, subtask3_03.txt, subtask3_04.txt, subtask3_05.txt, subtask3_06.txt, subtask3_07.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 28 ms | 916 KB |
sample_02.txt | AC | 29 ms | 804 KB |
subtask1_01.txt | AC | 25 ms | 916 KB |
subtask1_02.txt | AC | 25 ms | 916 KB |
subtask1_03.txt | AC | 26 ms | 792 KB |
subtask1_04.txt | AC | 26 ms | 916 KB |
subtask1_05.txt | AC | 26 ms | 868 KB |
subtask1_06.txt | AC | 27 ms | 796 KB |
subtask1_07.txt | AC | 27 ms | 920 KB |
subtask1_08.txt | AC | 25 ms | 916 KB |
subtask1_09.txt | AC | 27 ms | 856 KB |
subtask2_01.txt | AC | 26 ms | 908 KB |
subtask2_02.txt | AC | 39 ms | 884 KB |
subtask2_03.txt | AC | 69 ms | 916 KB |
subtask2_04.txt | AC | 63 ms | 812 KB |
subtask2_05.txt | AC | 105 ms | 908 KB |
subtask2_06.txt | AC | 119 ms | 920 KB |
subtask2_07.txt | AC | 117 ms | 916 KB |
subtask2_08.txt | AC | 119 ms | 916 KB |
subtask3_01.txt | AC | 119 ms | 876 KB |
subtask3_02.txt | TLE | 2037 ms | 2520 KB |
subtask3_03.txt | TLE | 2036 ms | 1380 KB |
subtask3_04.txt | TLE | 2035 ms | 1512 KB |
subtask3_05.txt | TLE | 2035 ms | 2536 KB |
subtask3_06.txt | TLE | 2036 ms | 2536 KB |
subtask3_07.txt | TLE | 2035 ms | 2544 KB |