Submission #1370356

#	Time	Username	Problem	Language	Result	Execution time	Memory
1370356		solution6312	Splits (CEOI25_splits)	C++17	6 / 100	0 ms	344 KiB

splits

#include <iostream>
#include <vector>
using namespace std;
using ll=long long;

const ll mod=(119<<23)+1;

int solve(int n, int m, vector<vector<int>> &splits)
{
    ll ans=1;
    for (int i=2; i<=n; i++) ans=(ans+ans+i-2)%mod;
    return ans;
}

• Subtask 1: 6 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 17
• Subtask 4: 0 / 17
• Subtask 5: 0 / 16
• Subtask 6: 0 / 16
• Subtask 7: 0 / 21