# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
748184 | NemanjaSo2005 | Council (JOI23_council) | C++17 | 2385 ms | 335156 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int kritv,N,M,K,maks[300005],maska[300005],glasa[300005][25],ukup[25],res[300005];
const int stepen[25]={1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768,65536,131072,262144,524288,1048576,2097152,4194304,8388608,16777216};
int dist[1050005][2];
int koji[1050005];
/*
0 - Moze a ne mora za to da ne glasa
1 - Mora da to da ne glasa
Dodavanje - 0 u 1 dodaje 1 cene
Ispitivanje - 1 u 0 dodaje 1 cene
*/
queue<pair<int,int> > Q[25];
pair<int,int> pp;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cin>>N>>M;
kritv=N/2;
K=(M/2);
for(int i=1;i<=N;i++){
for(int j=0;j<M;j++)
cin>>glasa[i][j];
for(int j=0;j+j<M;j++)
swap(glasa[i][j],glasa[i][M-1-j]);
for(int j=0;j<M;j++){
ukup[j]+=glasa[i][j];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |