oj.uz

답안 #43187

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
43187 2018-03-10T13:14:17 Z jwvg0425 즐거운 사진 수집 (JOI13_collecting) C++14
30 / 100
 5000 ms 25348 KB 
#include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <map>
#include <set>
#include <tuple>
#include <string.h>
#include <math.h>
#include <random>
#include <functional>
#include <assert.h>
#include <math.h>
#include <sstream>
#include <iterator>
#include <regex>
#define MOD 1000000007

using namespace std;

using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;

class FenwickTree
{
public:
    FenwickTree(int k)
    {
        data.resize(k);
    }

    i64 sum(int n)
    {
        i64 ans = 0;

        while (n > 0)
        {
            ans += data[n];
            n -= (n & -n);
        }

        return ans;
    }

    void add(int n, i64 num)
    {
        while (n < data.size())
        {
            data[n] += num;
            n += (n & -n);
        }
    }

private:
    vector<i64> data;
};

int total = 1;

void update(int x, int y, int n,  vector<int>& v, FenwickTree& lr, FenwickTree& ud, int change)
{
    if (n == 1)
        return;

    int lrt = lr.sum(x + n - 1) - lr.sum(x - 1);
    int udt = ud.sum(y + n - 1) - ud.sum(y - 1);

    //다 같은 색
    if ((udt==0 || udt == n))
    {
        if ((lrt == 0 || lrt == n))
            total -= 4;
        else if (((v[change] == 1 && lrt == 1) || (v[change] == 0 && lrt == n - 1))) // 원래 통째로 였다가 나뉜거
            total += 4;
    }

    int hn = n / 2;

    if (change < x + hn)
    {
        update(x, y, hn, v, lr, ud, change);
        update(x, y + hn, hn, v, lr, ud, change);
    }
    else
    {
        update(x + hn, y, hn, v, lr, ud, change);
        update(x + hn, y + hn, hn, v, lr, ud, change);
    }
}

int main()
{
    int n, q;
    scanf("%d %d", &n, &q);

    vector<int> lr((1 << n) + 1);
    vector<int> ud((1 << n) + 1);
    FenwickTree lrtree((1 << n) + 1);
    FenwickTree udtree((1 << n) + 1);

    for (int i = 0; i < q; i++)
    {
        int t, x;
        scanf("%d %d", &t, &x);

        vector<int>& v = t == 0 ? lr : ud;
        FenwickTree& tree = t == 0 ? lrtree : udtree;
        FenwickTree& other = t == 0 ? udtree : lrtree;

        int prev = v[x];

        if (v[x] == 0)
            v[x] = 1;
        else
            v[x] = 0;

        tree.add(x, v[x] - prev); 
        update(1, 1, (1 << n), v, tree, other, x);
        printf("%d\n", total);
    }

    return 0;
}

Compilation message

collecting.cpp: In member function 'void FenwickTree::add(int, i64)':
collecting.cpp:51:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while (n < data.size())
                  ^
collecting.cpp: In function 'int main()':
collecting.cpp:98:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &q);
                           ^
collecting.cpp:108:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &t, &x);
                               ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 248 KB Output is correct
2 Correct 2 ms 480 KB Output is correct
3 Correct 2 ms 480 KB Output is correct
4 Correct 2 ms 480 KB Output is correct
5 Correct 2 ms 480 KB Output is correct
6 Correct 2 ms 524 KB Output is correct
7 Correct 2 ms 540 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 720 KB Output is correct
2 Correct 49 ms 768 KB Output is correct
3 Correct 87 ms 768 KB Output is correct
4 Correct 84 ms 768 KB Output is correct
5 Correct 42 ms 768 KB Output is correct
6 Correct 82 ms 768 KB Output is correct
7 Correct 75 ms 876 KB Output is correct
8 Correct 78 ms 876 KB Output is correct

Subtask #3
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5037 ms 25348 KB Time limit exceeded
2 Halted 0 ms 0 KB -