oj.uz

Submission #906579

# Submission time Handle Problem Language Result Execution time Memory
906579 2024-01-14T13:44:09 Z NemanjaSo2005 Plus Minus (BOI17_plusminus) C++17
100 / 100
 129 ms 8412 KB 
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll N,M,K;
const int maxn=1e5+5;
const ll MOD=1e9+7;
map<int,int> mapa;
int X[maxn],Y[maxn],sta[maxn];
ll stepen(ll a,int koji=MOD-2){
   if(koji==0)
      return 1;
   if(koji==1)
      return a;
   ll ret=stepen(a,koji/2);
   ret=(ret*ret)%MOD;
   if(koji&1)
      ret=(ret*a)%MOD;
   return ret;
}
ll broj(){
   mapa.clear();
   for(int i=1;i<=K;i++){
      int bibio=(Y[i]&1)^sta[i];
      if(mapa.find(X[i])==mapa.end())
         mapa[X[i]]=bibio;
      else
         if(mapa[X[i]]!=bibio)
            return 0;
   }
   //cout<<M<<" "<<mapa.size()<<endl;
   return stepen(2,N-mapa.size());
}
void flip(){
   swap(N,M);
   for(int i=1;i<=K;i++)
      swap(X[i],Y[i]);
}
int checkboard(int x){
   for(int i=1;i<=K;i++)
      if(x^(Y[i]&1)^(X[i]&1)^sta[i])
         return 0;
   return 1;
}
int main(){
   cin>>N>>M>>K;
   for(int i=1;i<=K;i++){
      char c;
      cin>>c>>X[i]>>Y[i];
      sta[i]=(c=='+');
   }
   ll res=0;
   res+=broj();
   flip();
   res+=broj();
   res-=checkboard(0);
   res-=checkboard(1);
   cout<<res%MOD<<"\n";
   return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 452 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 39 ms 2388 KB Output is correct
17 Correct 36 ms 2388 KB Output is correct
18 Correct 35 ms 2352 KB Output is correct
19 Correct 55 ms 2396 KB Output is correct
20 Correct 56 ms 2392 KB Output is correct

Subtask #3
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 452 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 39 ms 2388 KB Output is correct
17 Correct 36 ms 2388 KB Output is correct
18 Correct 35 ms 2352 KB Output is correct
19 Correct 55 ms 2396 KB Output is correct
20 Correct 56 ms 2392 KB Output is correct
21 Correct 100 ms 5716 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 46 ms 2940 KB Output is correct
24 Correct 47 ms 2772 KB Output is correct
25 Correct 46 ms 2840 KB Output is correct
26 Correct 78 ms 6172 KB Output is correct
27 Correct 77 ms 5636 KB Output is correct
28 Correct 95 ms 6228 KB Output is correct
29 Correct 104 ms 7104 KB Output is correct
30 Correct 129 ms 8412 KB Output is correct