Compare text

Find the difference between two text files

Real-time diff

Unified diff

Collapse lines

Highlight change

Syntax highlighting

Tools

Diffchecker Desktop The most secure way to run Diffchecker. Get the Diffchecker Desktop app: your diffs never leave your computer!Get Desktop

Comparing sensitive data, confidential files or internal emails?

Most legal and privacy policies prohibit uploading sensitive data online. Diffchecker Desktop ensures your confidential information never leaves your computer. Work offline and compare documents securely.

Download Diffchecker Desktop Learn more

Untitled diff

Created 7 years agoDiff never expires

1 removal

62 lines

1 addition

62 lines

#include<bits/stdc++.h>

using namespace std;

#define MOD 1000000007LL

#define M 1

#define X first

#define Y second

typedef long long ll;

typedef pair< int, int >pii;

typedef pair< ll , ll >pll;

ll one = 1LL;

ll c[39];

ll n;

ll cst(ll msk)

{

ll rt = 0;

for (ll i = 0; i < 31; i++) {

if (msk&(one<<i)) {

if (i < n) rt += c[i];

else rt += (c[n-1] << (i-n+1));

}

//cout << "cost for " << msk << " -> " << rt << endl;

return rt;

}

int main()

{

std::ios::sync_with_stdio(false);

ll L;

cin >> n >> L;

for (ll i = 0; i < n; i++) cin >> c[i];

for (ll i = 1; i < n; i++) {

c[i] = min(c[i], c[i-1]*2);

//cout << "c[" << i << "] = " << c[i] << endl;

}

ll ans = cst(L);

while (true) {

ll i;

for (i = 0; (L&(one<<i))==0 ; i++);

if (i > n) break;

if (i > 30) break;

ans = min(ans, cst(L));

for ( ; (L&(one<<i)); i++) {

L ^= (one<<i);

}

L ^= (one<<i);

}

cout << ans << endl;

return 0;

}

Saved diffs

Original text

Open file

#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007LL
#define M 1
#define X first
#define Y second

typedef long long ll;
typedef pair< int, int >pii;
typedef pair< ll , ll >pll;

ll one = 1LL;

ll c[39];
ll n;

ll cst(ll msk)
{
    ll rt = 0;
    for (ll i = 0; i < 31; i++) {
        if (msk&(one<<i)) {
            if (i < n) rt += c[i];
            else rt += (c[n-1] << (i-n+1));
        }
    }
    //cout << "cost for " << msk << " -> " << rt << endl;
    return rt;
}

int main()
{
    std::ios::sync_with_stdio(false);

ll L;

cin >> n >> L;

for (ll i = 0; i < n; i++) cin >> c[i];

for (ll i = 1; i < n; i++) {
        c[i] = min(c[i], c[i-1]*2);
        //cout << "c[" << i << "] = " << c[i] << endl;
    }

ll ans = cst(L);

while (true) {
        ll i;
        for (i = 0; (L&(one<<i))==0 ; i++);
        if (i > n) break;
        ans = min(ans, cst(L));
        for ( ; (L&(one<<i)); i++) {
            L ^= (one<<i);
        }
        L ^= (one<<i);
    }

cout << ans << endl;

return 0;
}

Changed text

Open file

#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007LL
#define M 1
#define X first
#define Y second

typedef long long ll;
typedef pair< int, int >pii;
typedef pair< ll , ll >pll;

ll one = 1LL;

ll c[39];
ll n;

int main()
{
    std::ios::sync_with_stdio(false);

ll L;

cin >> n >> L;

for (ll i = 0; i < n; i++) cin >> c[i];

for (ll i = 1; i < n; i++) {
        c[i] = min(c[i], c[i-1]*2);
        //cout << "c[" << i << "] = " << c[i] << endl;
    }

ll ans = cst(L);

while (true) {
        ll i;
        for (i = 0; (L&(one<<i))==0 ; i++);
        if (i > 30) break;
        ans = min(ans, cst(L));
        for ( ; (L&(one<<i)); i++) {
            L ^= (one<<i);
        }
        L ^= (one<<i);
    }

cout << ans << endl;

return 0;
}