Submission #1119221

#	Time	Username	Problem	Language	Result	Execution time	Memory
1119221		MateiKing80	Sum Zero (RMI20_sumzero)	C++14	0 / 100	10 ms	41296 KiB

sumzero

#include <bits/stdc++.h>

using namespace std;

int lift[19][1 << 19];
int a[1 << 19];

int main()
{
    int n, q;
    cin >> n >> q;
    for(int i = 1; i <= n; i ++)
        cin >> a[i], a[i] += a[i - 1];
    for(int i = 0; i < 19; i ++)
        for(int j = 0; j < (1 << 19); j ++)
            lift[i][j] = i + j;
    map<int, int> mp;
    int last = n + 1; //se termina aici
    for(int i = n; i; i --)
    {
        if(mp[a[i]] != 0)
            last = min(last, mp[a[i]]);
        mp[a[i]] = i;

    }
}
/*
ne trebuie prima pereche de sume partiale egale care se afla
la dreapta unui punct
si facem binary lifting pe tot
yessir
*/

• Subtask 1: 0 / 22
• Subtask 2: 0 / 39
• Subtask 3: 0 / 39