-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdatamaker.hpp
158 lines (158 loc) · 3.22 KB
/
datamaker.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
#pragma once
#include<bits/stdc++.h>
using namespace std;
mt19937_64 Rand;
char inFile[1024],outFile[1024];
char cmd[1024];
char problemName[1024];
inline
void init(string filename="",int dataId=-1)
{
freopen("gen.cfg","r",stdin);
int g=0;
cin>>g;
freopen("gen.cfg","w",stdout);
cout<<g+1<<endl;
Rand=mt19937_64(g);
if(dataId!=-1)
{
sprintf(inFile,"%s%d.in",filename.c_str(),dataId);
sprintf(problemName,"%s",filename.c_str());
freopen(inFile,"w",stdout);
return;
}
freopen("data.in","w",stdout);
}
inline
void genOut(int dataId)
{
fclose(stdout);
sprintf(cmd,"./%s.lexe < %s%d.in > %s%d.out",problemName,problemName,dataId,problemName,dataId);
system(cmd);
}
#define int long long
inline
int randNum(int minLimit,int maxLimit)
{
if(minLimit==maxLimit)
return minLimit;
return minLimit+Rand()%(maxLimit-minLimit+1);
}
inline
pair<int,int> randInterval(int minLimit,int maxLimit)
{
int n=maxLimit-minLimit+1;
int l=randNum(1,n),r=randNum(1,n);
if(r<=l)
swap(l,r);
return make_pair(minLimit+l-1,minLimit+r-1);
}
inline
vector<int> randSplit(int n,int sum,int minLimit=0,int maxLimit=2139062143)
{
vector<int> ans;
ans.clear();
sum-=n*minLimit;
if(sum<0||maxLimit<minLimit)
return ans;
maxLimit-=minLimit;
for(int i=1;i<=n;i++)
{
ans.push_back(minLimit+(i==n?sum:randNum(max(0LL,sum-1LL*maxLimit*(n-i)),min(maxLimit,2*sum/(n-i+1)))));
sum-=(ans[i-1]-minLimit);
}
shuffle(ans.begin(),ans.end(),Rand);
return ans;
}
inline
vector<int> pruferDecode(vector<int> prf,int n)
{
vector<int> fth(n+1),deg(n+1,1);
for(int i=1;i<prf.size();i++)
deg[prf[i]]+=1;
int u=1;
for(int i=1;i<prf.size();)
{
while(deg[u]!=1)
u++;
if(u==n)
break;
int v=u;
while(deg[v]==1)
{
fth[v]=prf[i];
deg[v]--;
deg[prf[i]]--;
i++;
if(i==prf.size()||prf[i-1]>u)
break;
v=prf[i-1];
}
}
fth[prf.back()]=n;
return fth;
}
void orderTree(vector<vector<int>> &t,int u,int f,vector<vector<int>> &ans)
{
for(int i=0;i<t[u].size();i++)
{
int v=t[u][i];
if(v==f)
continue;
ans[u].push_back(v);
orderTree(t,v,u,ans);
}
}
inline
vector<vector<int>> randTree(int n)
{
vector<int> prf(1,0);
vector<vector<int>> t(n+1,vector<int>(0));
for(int i=1;i<=n-2;i++)
prf.push_back(randNum(1,n));
vector<int> fth=pruferDecode(prf,n);
for(int i=n;i>=1;i--)
{
if(fth[i]==0)
continue;
t[fth[i]].push_back(i);
t[i].push_back(fth[i]);
}
vector<vector<int>> ans(n+1,vector<int>(0));
orderTree(t,1,0,ans);
return ans;
}
void buildBracketString(vector<vector<int>> &t,int u,string &s)
{
for(int i=0;i<t[u].size();i++)
{
s+='(';
buildBracketString(t,t[u][i],s);
s+=')';
}
}
string randBracketString(int n)
{
vector<vector<int>> t=randTree(n+1);
string s="";
buildBracketString(t,1,s);
return s;
}
namespace charSet
{
string lowLetters="abcdefghijklmnopqrstuvwxyz";
string capLetters="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string numbers="0123456789";
}
inline
string randString(int minLen,int maxLen,string charSet)
{
int len=randNum(minLen,maxLen);
string ans="";
for(int i=1;i<=len;i++)
{
ans+=charSet[randNum(0,charSet.size()-1)];
}
return ans;
}
#undef int