usingnamespacestd;typedeflonglongll;constintmaxn=1e4+5;constintmod=1e9+7;constintINF=1<<30;structnode{stringsection,key,value;node(strings="",stringk="",stringv=""){secti...
using namespace std;
typedef long long ll;
const int maxn = 1e4+5;
const int mod = 1e9+7;
const int INF = 1<<30;
struct node
{
string section, key, value;
node(string s="", string k="", string v="")
{
section = s;
key = k;
value = v;
}
bool operator
{
if(section != n.section)
return section
return key
}
}in[maxn];
void trim(string& s)
{
s.erase(s.find_last_not_of(" ") + 1);
s