# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
994065 | vjudge1 | Rima (COCI17_rima) | C++17 | 1076 ms | 102060 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int h = 727, mod = 1e9 + 7;
const int h1 = 7369, mod1 = 998244353;
const int enc = 8369, mod2 = 1LL<<36;
const int M = 3e6;
int pw[M],pw1[M];
inline int en(int has,int has1)
{
return (has1*enc+has)%mod2;
}
signed main()
{
pw[0]=pw1[0]=1;
for (int i=1;i<M;i++)
pw[i]=pw[i-1]*h%mod,pw1[i]=pw1[i-1]*h1%mod1;
int n;
cin>>n;
map<int,vector<string>> mp;
for (int i=0;i<n;i++)
{
string s;
cin>>s;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |