Submission #1303620

#	Time	Username	Problem	Language	Result	Execution time	Memory
1303620		activedeltorre	Game (IOI13_game)	C++20	37 / 100	13089 ms	5572 KiB

game

#include "game.h"
#include<map>
#include<vector>
using namespace std;
long long gcd2(long long X, long long Y) {
    long long tmp;
    while (X != Y && Y != 0) {
        tmp = X;
        X = Y;
        Y = tmp % Y;
    }
    return X;
}
struct ura
{
    int a,b;
    long long value;
};
map<pair<int,int>,int>mp;
int ids=0;
int invector[25000];
int bucket[25000];
vector<ura>pset;
vector<ura>nset;
void recalcbucket(int id)
{

}
void init(int R, int C) {
}

void update(int P, int Q, long long K) {
    if(mp[{P,Q}]==0)
    {
        ids++;
        mp[{P,Q}]=ids;
        invector[ids]=0;
        nset.push_back({P,Q,K});
    }
    else
    {
        if(invector[mp[{P,Q}]]==1)
        {
            recalcbucket(mp[{P,Q}]);
        }
        else
        {
            for(int i=0;i<nset.size();i++)
            {
                if(P==nset[i].a && Q==nset[i].b)
                {
                    nset[i].value=K;
                }
            }
        }
    }
}

long long calculate(int P, int Q, int U, int V) {
    long long rez=0;
    for(int i=0;i<nset.size();i++)
    {
        if(P<=nset[i].a && nset[i].a<=U && Q<=nset[i].b && nset[i].b<=V)
        rez=gcd2(rez,nset[i].value);
    }
    return rez;
}

• Subtask 1: 10 / 10
• Subtask 2: 27 / 27
• Subtask 3: 0 / 26
• Subtask 4: 0 / 17
• Subtask 5: 0 / 20