Shubham Singh | Commonlounge

NaN.

discussion

[IOI 2000] Palindromeby Udit Sanghi

This problem would have been a classical problem if the memory limits would not have been that tight. In the classical version we can use DP or the LCS with O(n^2) memory but this problem requires O(n) memory.

How to go about it?

Read more…(39 words)

Copied

reply in this discussion

Shubham Singh2y

am getting 2 WA,help me..

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<ll,ll>
#define F first
#define S second
#define pb push_back
//pii p[1001000];
pair<int,int> p[100100];
string s,s1;
int dp[2][50030],d,ans=1e7,n,m,mod=20011,sum=0;
 
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
     {
          cin>>p[i].F>>p[i].S;
          sum+=p[i].F+p[i].S;
     }
     dp[0][0]=1;
     for(int i=1;i<=n;i++){

Read more…(59 words)

Copied

reply in this discussion

Shubham Singh2y

i am getting RE,please help,

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<ll,ll>
#define F first
#define S second
#define pb push_back
pii p[1001000];
 
string s,s1;
int dp[2][5003],d,ans=0,n,m,mod=20011;
 
int main()
{
    cin>>n;
    cin>>s;
    s1=s;
    reverse(s1.begin(),s1.end());
    
    for(int i=1;i<=n;i++){
         for(int j=1;j<=n;j++){
              int x;