oj.uz

Submission #834810

# Submission time Handle Problem Language Result Execution time Memory
834810 2023-08-22T20:13:06 Z oscar1f Vision Program (IOI19_vision) C++17
47 / 100
 7 ms 1232 KB 
#include<bits/stdc++.h>
#include "vision.h"

using namespace std;

int nbLig,nbCol,distObj;
vector<int> listeLig,listeCol,distLig,distCol;

bool estPN(int nb) {
    int div=2,nbFact=0;
    while (nb>1) {
        if (nb%div==0) {
            while (nb%div==0) {
                nb/=div;
            }
            nbFact++;
        }
        div++;
    }
    return (nbFact<=1);
}

vector<int> calcDist(vector<int> val) {
    vector<int> rep,quest,globQuest;
    vector<pair<int,int>> listePN;
    int taille=val.size(),temp;
    rep.push_back(add_xor(val));
    if (taille>1) {
        for (int i=1;i<taille;i++) {
            if (estPN(i)) {
                //cout<<i<<" ";
                globQuest.clear();
                for (int j=0;j<i;j++) {
                    quest.clear();
                    for (int k=j;k<taille;k+=i) {
                        quest.push_back(val[k]);
                    }
                    if (quest.size()>1) {
                        globQuest.push_back(add_and({add_or(quest),add_not(add_xor(quest))}));
                    }
                }
                listePN.push_back({i,add_or(globQuest)});
                temp=add_not(listePN.back().second);
            }
        }
        for (int i=1;i<taille;i++) {
            quest.clear();
            for (auto div:listePN) {
                if (i%div.first==0) {
                    quest.push_back(div.second);
                }
                else {
                    quest.push_back(div.second+1);
                }
            }
            rep.push_back(add_and(quest));
        }
    }
    /*else {
        for (int i=1;i<taille;i++) {
            quest.clear();
            for (int a=0;a<taille;a++) {
                for (int b=a+1;b<taille;b++) {
                    if (b-a==i) {
                        quest.push_back(add_and({val[a],val[b]}));
                    }
                } 
            }
            rep.push_back(add_or(quest));
        }
    }*/
    return rep;
}

void construct_network(int H, int W, int K) {
	nbLig=H;
	nbCol=W;
	distObj=K;
    vector<int> quest;
	for (int j=0;j<nbCol;j++) {
        quest.clear();
        for (int i=0;i<nbLig;i++) {
            quest.push_back(i*nbCol+j);
        }
        listeCol.push_back(add_or(quest));
    }
    distCol=calcDist(listeCol);
    for (int i=0;i<nbLig;i++) {
        quest.clear();
        for (int j=0;j<nbCol;j++) {
            quest.push_back(i*nbCol+j);
        }
        listeLig.push_back(add_or(quest));
    }
    distLig=calcDist(listeLig);
    quest.clear();
    for (int i=0;i<nbLig;i++) {
        for (int j=0;j<nbCol;j++) {
            if (i+j==distObj) {
                quest.push_back(add_and({distLig[i],distCol[j]}));
            }
        }
    }
    add_or(quest);
}

Compilation message

vision.cpp: In function 'std::vector<int> calcDist(std::vector<int>)':
vision.cpp:26:27: warning: variable 'temp' set but not used [-Wunused-but-set-variable]
   26 |     int taille=val.size(),temp;
      |                           ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 224 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 224 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 224 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 224 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 6 ms 1104 KB Output is correct
39 Correct 2 ms 596 KB Output is correct
40 Correct 3 ms 596 KB Output is correct
41 Correct 4 ms 724 KB Output is correct
42 Correct 4 ms 724 KB Output is correct
43 Correct 6 ms 1104 KB Output is correct
44 Correct 6 ms 1148 KB Output is correct
45 Correct 6 ms 1104 KB Output is correct
46 Correct 7 ms 1128 KB Output is correct
47 Correct 6 ms 1048 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1104 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 724 KB Output is correct
4 Correct 4 ms 724 KB Output is correct
5 Correct 3 ms 724 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 3 ms 724 KB Output is correct
8 Correct 5 ms 976 KB Output is correct
9 Correct 5 ms 976 KB Output is correct
10 Correct 6 ms 976 KB Output is correct
11 Correct 5 ms 976 KB Output is correct
12 Correct 5 ms 976 KB Output is correct
13 Incorrect 1 ms 1104 KB WA in grader: Too many instructions
14 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1232 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 224 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 6 ms 1104 KB Output is correct
39 Correct 2 ms 596 KB Output is correct
40 Correct 3 ms 596 KB Output is correct
41 Correct 4 ms 724 KB Output is correct
42 Correct 4 ms 724 KB Output is correct
43 Correct 6 ms 1104 KB Output is correct
44 Correct 6 ms 1148 KB Output is correct
45 Correct 6 ms 1104 KB Output is correct
46 Correct 7 ms 1128 KB Output is correct
47 Correct 6 ms 1048 KB Output is correct
48 Incorrect 1 ms 1104 KB WA in grader: Too many instructions
49 Halted 0 ms 0 KB -