oj.uz

답안 #972153

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
972153 2024-04-30T07:45:19 Z grafff 디지털 회로 (IOI22_circuit) C++17
2 / 100
 1251 ms 3160 KB 
#include <bits/stdc++.h>
#include "circuit.h"
#define ll int
#define all(x) x.begin(), x.end()
#define x_c first
#define y_c second

using namespace std;

ll n, m, MOD = 1000002022;
vector <ll> p, a;
vector <bool> flag(9);
vector <vector <ll>> gr;

int group_1(int l, int r)
{
    for(int i = l; i <= r; i++)
    {
        a[i - n] = 1 - a[i - n];
    }
    ll col = 0;
    for(int i = 0; i < m; i++)
    {
        col += a[i];
    }
    return col;
}

int count_ways(int L, int R)
{
    return group_1(L, R);
}

void init(int N, int M, vector <int> P, vector <int> A)
{
    n = N;
    m = M;
    p = P;
    a = A;
    gr.resize(n);
    ll mx = 0;
    for(int i = 1; i < n + m; i++)
    {
        gr[p[i]].push_back(i);
        ll h = gr[p[i]].size();
        mx = max(mx, h);
    }
    if(n == 1)
    {
        flag[1] = true;
    }
    else if(n <= 1000 && mx <= 2)
    {
        flag[2] = true;
    }
    else if(mx <= 2)
    {
        flag[6] = true;
    }
    else if(n <= 1000 && m <= 1000)
    {
        flag[3] = true;
    }
    else if(n <= 5000 && m <= 5000)
    {
        flag[7] = true;
    }
}
/*
int main()
{
}*/

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '52130940', found: '128'
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '52130940', found: '128'
11 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1251 ms 3160 KB 1st lines differ - on the 1st token, expected: '431985922', found: '16402'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1251 ms 3160 KB 1st lines differ - on the 1st token, expected: '431985922', found: '16402'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '52130940', found: '128'
3 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '52130940', found: '128'
11 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '52130940', found: '128'
11 Halted 0 ms 0 KB -